A Note on Dynamic Gröbner Bases Computation
From MaRDI portal
Publication:2830005
DOI10.1007/978-3-319-45641-6_18zbMATH Open1453.13080OpenAlexW2517219774MaRDI QIDQ2830005FDOQ2830005
Authors: Amir Hashemi, Delaram Talaashrafi 
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
Recommendations
- scientific article; zbMATH DE number 1263330
- Dynamical Gröbner bases
- Computation of Gröbner bases
- A new framework for computing Gröbner bases
- scientific article; zbMATH DE number 3857248
- A note on Gröbner bases and Berlekamp's algorithm
- A note on Gröbner bases
- scientific article; zbMATH DE number 5494047
- A dynamic F4 algorithm to compute Gröbner bases
- Dynamical Gröbner bases over Dedekind rings
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- A Singular Introduction to Commutative Algebra
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- The Gröbner fan of an ideal
- On an installation of Buchberger's algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
Cited In (7)
- Dynamic.sage
- A comparison of unrestricted dynamic Gröbner basis algorithms
- A dynamic F4 algorithm to compute Gröbner bases
- Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
- Exploring the dynamic Buchberger algorithm
- Title not available (Why is that?)
- Conditional Gröbner basis: Gröbner basis detection with parameters
Uses Software
This page was built for publication: A Note on Dynamic Gröbner Bases Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830005)
