A Note on Dynamic Gröbner Bases Computation

DOI10.1007/978-3-319-45641-6_18zbMath1453.13080OpenAlexW2517219774MaRDI QIDQ2830005

Delaram Talaashrafi, Amir Hashemi

Publication date: 9 November 2016

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45641-6_18

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 (3)

A comparison of unrestricted dynamic Gröbner basis algorithms ⋮ A dynamic F4 algorithm to compute Gröbner bases ⋮ Dynamic.sage

Uses Software

• SageMath
• SINGULAR

Cites Work

• Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
• The Gröbner fan of an ideal
• On an installation of Buchberger's algorithm
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• A Singular Introduction to Commutative Algebra
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Note on Dynamic Gröbner Bases Computation