Proof of the Faugère criterion for the F5 algorithm
From MaRDI portal
Publication:650306
DOI10.1134/S0001434610090191zbMath1258.13031MaRDI QIDQ650306
Publication date: 25 November 2011
Published in: Mathematical Notes (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) 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)
Related Items (3)
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
Cites Work
This page was built for publication: Proof of the Faugère criterion for the F5 algorithm
