Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals

DOI10.1134/S0361768810020040zbMath1204.13001MaRDI QIDQ1956953

A. I. Zobnin

Publication date: 24 September 2010

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (6)

An improvement for GVW ⋮ A new proof for the correctness of the F5 algorithm ⋮ Proof of the Faugère criterion for the F5 algorithm ⋮ Termination of the F5 algorithm ⋮ A new signature-based algorithms for computing Gröbner bases ⋮ Simple signature based iterative algorithm for calculation of Gröbner bases

Uses Software

• FGb
• F5C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
• Algebraic Attacks Galore!
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals