The termination of the F5 algorithm revisited

DOI10.1145/2465506.2465520zbMATH Open1360.68949OpenAlexW2020179897MaRDI QIDQ2963248FDOQ2963248

Authors: Senshan Pan, Yupu Hu, Baocang Wang 

Publication date: 10 February 2017

Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2465506.2465520

Recommendations

• Termination of the F5 algorithm
• scientific article; zbMATH DE number 5831023
• Modifying Faugère's F5 algorithm to ensure termination
• The F5 criterion revised
• A new proof for the correctness of the F5 algorithm

zbMATH Keywords

terminationF5F5GENGröbner basis

Mathematics Subject Classification ID

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

Cited In (6)

• A new framework for computing Gröbner bases
• Termination of the F5 algorithm
• A survey on signature-based algorithms for computing Gröbner bases
• Title not available (Why is that?)
• Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm
• Modifying Faugère's F5 algorithm to ensure termination

This page was built for publication: The termination of the F5 algorithm revisited

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