Search results

From ApCoCoAWiki

Page title matches

  • User documentation for files FGLM.C and FGLM.H The FGLM algorithm lets you convert G into a Groebner basis G'
    2 KB (407 words) - 15:44, 21 October 2007
  • #REDIRECT [[ApCoCoA:FGLM.FGLM]]
    31 bytes (4 words) - 15:44, 21 April 2009

Page text matches

  • <title>FGLM.FGLM</title> <short_description>Performs a FGLM Groebner Basis conversion using ApCoCoAServer.</short_description>
    2 KB (386 words) - 10:00, 7 October 2020
  • <short_description>Perform a FGLM Groebner Basis conversion using CoCoAServer</short_description> The function <tt>FGLM</tt> calls the CoCoAServer to perform a
    1 KB (218 words) - 16:09, 5 November 2008
  • User documentation for files FGLM.C and FGLM.H The FGLM algorithm lets you convert G into a Groebner basis G'
    2 KB (407 words) - 15:44, 21 October 2007
  • # FGLM # FGLM
    2 KB (331 words) - 16:01, 14 October 2007
  • * an FGLM implementation by Stefan Kaspar
    1 KB (158 words) - 10:29, 5 December 2007
  • [[:Image:KR_tutorial_2.pdf|Tutorial 2: Faster! Faster! The FGLM Speed-Up]]
    1 KB (186 words) - 13:22, 22 June 2007
  • ...ring based on this PPMonoid reacts to algorithms like Buchberger-Moeller, FGLM or BBasis.
    2 KB (349 words) - 15:42, 21 October 2007
  • <td>[[ApCoCoA:FGLM|FGLM]]</td>
    7 KB (1,071 words) - 12:02, 13 September 2019
  • dispString = 'FGLM';
    18 KB (2,260 words) - 10:13, 12 November 2008
  • ==[ ex-FGLM.C ]== FGLM algorithm to do Groebner Basis conversion.
    12 KB (1,646 words) - 15:03, 14 October 2007