A new algorithm for Gröbner bases conversion
From MaRDI portal
Recommendations
- Converting bases with the Gröbner walk
- A new Gröbner basis conversion method based on stabilization techniques
- A fast algorithm for Gröbner basis conversion and its applications
- A modified LLL algorithm for change of ordering of Gröbner basis
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
Cites work
- A fast algorithm for Gröbner basis conversion and its applications
- A new framework for computing Gröbner bases
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An efficient method for computing comprehensive Gröbner bases
- 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
- Computing Gröbner fans
- Converting bases with the Gröbner walk
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Hilbert functions and the Buchberger algorithm
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 4137919 (Why is no real title available?)
- scientific article; zbMATH DE number 3935185 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1120551 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- On the walk
- Syzygies, finite length modules, and random curves
- The generic Gröbner walk
- The Gröbner fan of an ideal
- Using Algebraic Geometry
This page was built for publication: A new algorithm for Gröbner bases conversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650576)
