Exploring the dynamic Buchberger algorithm

DOI10.1145/3087604.3087643MaRDI QIDQ5119963zbMATH OpenOpenAlexFDO

Authors 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

dynamic algorithmGröbner basesterm ordering

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)

Recommendations

• scientific article; zbMATH DE number 1263330
• Signature-based algorithms to compute Gröbner bases
• A comparison of unrestricted dynamic Gröbner basis algorithms
• Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
• A Note on Dynamic Gröbner Bases Computation

Cited in

(8)

• 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
• Applying Buchberger's criteria on Montes's DisPGB algorithm
• scientific article; zbMATH DE number 1263330 (Why is no real title available?)
• Accelerating Fourier-Motzkin elimination using bit pattern trees
• Learning a performance metric of Buchberger's algorithm
• Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm

This page was built for publication: Exploring the dynamic Buchberger algorithm

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