Title of article :
On the Complexity of Gröbner Bases Conversion
Author/Authors :
Michael Kalkbrener، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Pages :
9
From page :
265
To page :
273
Abstract :
In this paper, the complexity of the conversion problem for Gröbner bases is investigated. It is shown that for adjacent Gröbner bases F and G, the maximal degree of the polynomials in G, denoted by deg(G), is bounded by a quadratic polynomial in deg(F). For non-adjacent Gröbner bases, however, the growth of degrees can be doubly exponential.
Journal title :
Journal of Symbolic Computation
Serial Year :
1999
Journal title :
Journal of Symbolic Computation
Record number :
805390
Link To Document :
بازگشت