HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

On the complexity of the F5 Gröbner basis algorithm

Magali Bardet 1 Jean-Charles Faugère 2 Bruno Salvy 3
2 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
3 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We study the complexity of Gr¨obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We give a bound on the number of polynomials of degree d in a Gr¨obner basis computed by Faug'ere's F5 algorithm (2002) in this generic case for the grevlex ordering (which is also a bound on the number of polynomials for a reduced Gr¨obner basis, independently of the algorithm used). Next, we analyse more precisely the structure of the polynomials in the Gr¨obner bases with signatures that F5 computes and use it to bound the complexity of the algorithm. Our estimates show that the version of F5 we analyse, which uses only standard Gaussian elimination techniques, outperforms row reduction of the Macaulay matrix with the best known algorithms for moderate degrees, and even for degrees up to the thousands if Strassen's multiplication is used. The degree being fixed, the factor of improvement grows exponentially with the number of variables.
Document type :
Journal articles
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download

Contributor : Jean-Charles Faugère Connect in order to contact the contributor
Submitted on : Tuesday, September 16, 2014 - 2:48:23 PM
Last modification on : Monday, May 16, 2022 - 4:58:02 PM
Long-term archiving on: : Wednesday, December 17, 2014 - 11:21:39 AM


Files produced by the author(s)



Magali Bardet, Jean-Charles Faugère, Bruno Salvy. On the complexity of the F5 Gröbner basis algorithm. Journal of Symbolic Computation, Elsevier, 2015, 70, pp.49--70. ⟨10.1016/j.jsc.2014.09.025⟩. ⟨hal-01064519⟩



Record views


Files downloads