Exploring the Dynamic Buchberger Algorithm

DOI10.1145/3087604.3087643zbMath1457.68330OpenAlexW2738807549MaRDI QIDQ5119963

John Perry

Publication date: 9 September 2020

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

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

zbMATH Keywords

Gröbner basesdynamic algorithmterm ordering

Mathematics Subject Classification ID

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

Related Items (4)

A comparison of unrestricted dynamic Gröbner basis algorithms ⋮ A dynamic F4 algorithm to compute Gröbner bases ⋮ Two variations of graph test in double description method ⋮ Accelerating Fourier–Motzkin elimination using bit pattern trees

This page was built for publication: Exploring the Dynamic Buchberger Algorithm