source: git/Tst/Manual/Groebner_basis_conversion.tst @ 6fb723

spielwiese
Last change on this file since 6fb723 was 6051d87, checked in by Oleksandr Motsak <motsak@…>, 12 years ago
FIX: Manual examples need adaptation to be tests (due to HW/build-dependent output)
  • Property mode set to 100644
File size: 510 bytes
Line 
1LIB "tst.lib"; tst_init();
2  ring r =32003,(a,b,c,d,e),lp;
3  ideal i=a+b+c+d, ab+bc+cd+ae+de, abc+bcd+abe+ade+cde,
4          abc+abce+abde+acde+bcde, abcde-1;
5  int t=timer;
6  option(prot);
7  ideal j1=stdfglm(i);
8//  timer-t;
9  size(j1);   // size (no. of polys) in computed GB
10  t=timer;
11  ideal j2=stdhilb(i);
12//  timer-t;
13  size(j2);   // size (no. of polys) in computed GB
14  // usual Groebner basis computation for lex ordering
15  t=timer;
16  ideal j0 =std(i);
17  option(noprot);
18//  timer-t;
19tst_status(1);$
Note: See TracBrowser for help on using the repository browser.