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
Conference papers

A new efficient algorithm for computing Gröbner bases without reduction to zero F5

Jean-Charles Faugère 1, 2
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 CALFOR - Calcul formel
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper introduces a new efficient algorithm for computing Gröbner bases. We replace the Buchberger criteria by an optimal criteria. We give a proof that the resulting algorithm (called F5) generates no useless critical pairs if the input is a regular sequence. This a new result by itself but a first implementation of the algorithm F_5 shows that it is also very efficient in practice: for instance previously untractable problems can be solved (cyclic 10). In practice for most examples there is no reduction to zero. We illustrate this algorithm by one detailed example.
keyword : groebner
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:53:23 PM
Last modification on : Friday, February 4, 2022 - 4:17:50 AM



Jean-Charles Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero F5. International Symposium on Symbolic and Algebraic Computation Symposium - ISSAC 2002, Jul 2002, Villeneuve d'Ascq, France. pp.75-83, ⟨10.1145/780506.780516⟩. ⟨inria-00100995⟩



Record views