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.
https://hal.inria.fr/inria-00100996
Contributeur : Publications Loria
<>
Soumis le : mardi 26 septembre 2006 - 14:53:23
Dernière modification le : mercredi 9 mai 2018 - 15:46:12
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, 2002. 〈inria-00100996〉
