A new proof for the correctness of the F5 algorithm

DOI10.1007/s11425-012-4480-1zbMath1286.13026MaRDI QIDQ365812

Yao Sun, Ding-Kang Wang

Publication date: 9 September 2013

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-012-4480-1

zbMATH Keywords

Gröbner basis; correctness of F5; F5; F5-reduction; F5B

Mathematics Subject Classification ID

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

13B25: Polynomials over commutative rings

Related Items

An improvement over the GVW algorithm for inhomogeneous polynomial systems, Resultant elimination via implicit equation interpolation, A survey on signature-based algorithms for computing Gröbner bases, Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method, An improvement for GVW, A new signature-based algorithms for computing Gröbner bases

Uses Software

• F5C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
• A new incremental algorithm for computing Groebner bases
• A new framework for computing Gröbner bases
• A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras
• Signature-based algorithms to compute Gröbner bases
• A generalized criterion for signature related Gröbner basis algorithms