Termination of the F5 algorithm

DOI10.1134/S0361768814020042zbMath1323.68598MaRDI QIDQ2017770

V. V. Galkin

Publication date: 23 March 2015

Published in: Programming and Computer Software (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (2)

Axioms for a theory of signature bases ⋮ A survey on signature-based algorithms for computing Gröbner bases

Uses Software

• F5C

Cites Work

• Unnamed Item
• The F5 algorithm in Buchberger's style
• Extended \(F_5\) criteria
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• Proof of the Faugère criterion for the F5 algorithm
• Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
• A new incremental algorithm for computing Groebner bases
• Term Rewriting and All That
• Modifying Faugère's F5 algorithm to ensure termination
• Practical Gröbner basis computation

This page was built for publication: Termination of the F5 algorithm