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

Jean-Charles Faugère 1
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Goal of F5 Computing Gröbner bases of $(f_1,\ldots,f_m)$: Buchberger algorithm or F4 Open issue: remove useless computations. 90% of the time is spent in computing zero --> a more powerful criterion to remove useless critical pairs. Goal of F5: theoretical and practical answer.
keyword : groebner
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00100996
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 - 3:33:24 AM

Identifiers

  • HAL Id : inria-00100996, version 1

Collections

Citation

Jean-Charles Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero. Eighth Rhine Workshop on Computer Algebra -RWCA 2002, 2002, Mannheim, Germany. ⟨inria-00100996⟩

Share

Metrics

Record views

134