The termination of the F5 algorithm revisited

DOI10.1145/2465506.2465520zbMath1360.68949OpenAlexW2020179897MaRDI QIDQ2963248

Baocang Wang, Senshan Pan, Yu Pu Hu

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

zbMATH Keywords

Gröbner basisterminationF5F5GEN

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)

Related Items (2)

A new framework for computing Gröbner bases ⋮ A survey on signature-based algorithms for computing Gröbner bases

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