A new efficient algorithm for computing Gröbner bases without reduction to zero - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

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

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.

Keywords

Domains

Other [cs.OH]
No file

Dates and versions

inria-00100996 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100996 , version 1

Cite

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⟩
137 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More