From: rpearcea@gmail.com   
      
   On Monday, April 21, 2014 12:22:35 PM UTC-7, clicl...@freenet.de wrote:   
   > Many thanks. This polynomial is quite small for the amount of work   
   > needed to get it!   
      
   It's a problem for the Buchberger algorithm in Maple too.  Maple by default   
   computes a grevlex basis (called tdeg in Maple) and converts that using the   
   Groebner walk.  This strategy is quite common.  It can also use FGb   
   (instantaneous) or a Maple    
   implementation of F4 to compute the basis.  But the Buchberger algorithm takes   
   a very long time.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)