Complexity of Zero-dimensional Gröbner Bases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Complexity of Zero-dimensional Gröbner Bases


In this paper, it is shown that the Gröbner basis (for any monomial ordering) of a zero-dimensional ideal may be computed within a bit complexity which is essentially polynomial in $D^n$ where $n$ is the number of unknowns and $D$ the mean value of the degrees of input polynomials. Therefore, if all input polynomials have the same degree, this complexity is polynomial in the maximum of the input size and of the output size, for almost all inputs. The proof is designed in order that it may be generalized to the case of an ideal generated by a regular sequence and for the degree reverse lexicographic ordering, when the last variables are in generic position for the ideal. But one step of the proof is yet lacking in this case.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5660.pdf (394.47 Ko) Télécharger le fichier

Dates and versions

inria-00070348 , version 1 (19-05-2006)


  • HAL Id : inria-00070348 , version 1


Amir Hashemi, Daniel Lazard. Complexity of Zero-dimensional Gröbner Bases. [Research Report] RR-5660, INRIA. 2005, pp.29. ⟨inria-00070348⟩
136 View
673 Download


Gmail Facebook Twitter LinkedIn More