Details:
Title  Efficient computation of zerodimensional Gröbner bases by change of ordering  Author(s)  JeanCharles Faugère, Patrizia M. Gianni, Daniel Lazard, Ferdinando Mora  Type  Article in Journal  Abstract  We present an efficient algorithm for the transformation of a Gröbner basis of a zerodimensional ideal with respect to any given ordering into a Gröbner basis with respect to any other ordering. This algorithm is polynomial in the degree of the ideal. In particular the lexicographical Gröbner basis can be obtained by applying this algorithm after a total degree Gröbner basis computation: it is usually much faster to compute the basis this way than with a direct application of Buchberger's algorithm.  ISSN  07477171  Copyright  Academic Press 
URL 
dx.doi.org/10.1006/jsco.1993.1051 
Language  English  Journal  Journal of Symbolic Computation  Volume  16  Number  4  Pages  329344  Publisher  Academic Press, Inc.  Address  Duluth, MN, USA  Year  1993  Month  October  Translation 
No  Refereed 
No 
