The new is the well-forgotten old -- F4 algorithm optimization

DOI10.1134/S0965542524702154MaRDI QIDQ6986212zbMATH OpenFDO

Authors S. M. Styopkin

Publication date 12 May 2025

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

C++computational algebraF4profilingsoftware optimization

Mathematics Subject Classification ID

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

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• An extension of Buchberger's criteria for Gröbner basis decision
• Are Buchberger's criteria necessary for the chain condition?
• Corrigendum to ``Are Buchberger's criteria necessary for the chain condition? [J. Symbolic Comput. 42 (2007) 717-732]
• GBLA: Gröbner basis linear algebra package
• On an installation of Buchberger's algorithm
• The complexity of the word problems for commutative semigroups and polynomial ideals
• The Structure of Polynomial Ideals and Gröbner Bases

This page was built for publication: The new is the well-forgotten old -- F4 algorithm optimization

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