Proof of the Faugère criterion for the F5 algorithm

DOI10.1134/S0001434610090191MaRDI QIDQ650306zbMATH OpenFDO

Authors Oleg N. German

Publication date 25 November 2011

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434610090191

zbMATH Keywords

F5 algorithmfaugère criterionGröbner basishead termpolynomial ideal

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Recommendations

• A new proof for the correctness of the F5 algorithm
• The F5 criterion revised
• The F5 criterion revised
• Applying IsRewritten criterion on Buchberger algorithm
• Termination of the F5 algorithm

Cites work

• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals

Cited in

(7)

• Termination of the F5 algorithm
• On the parametrization of hyperelliptic fields with S-units of degrees 7 and 9
• Simple signature based iterative algorithm for calculation of Gröbner bases
• A novel proof of the Souriau-Frame-Faddeev algorithm
• scientific article; zbMATH DE number 4024656 (Why is no real title available?)
• Modifying Faugère's F5 algorithm to ensure termination
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases

This page was built for publication: Proof of the Faugère criterion for the F5 algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650306)