A new algorithm for computing staggered linear bases
From MaRDI portal
Publication:2687265
Recommendations
Cites work
- 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
- Asymmetric approach to computation of 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
- Computer Algebra in Scientific Computing
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1263375 (Why is no real title available?)
- scientific article; zbMATH DE number 1273640 (Why is no real title available?)
- scientific article; zbMATH DE number 1120551 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 2166957 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Involutive bases of polynomial ideals
- On an installation of Buchberger's algorithm
- On the construction of Gröbner bases using syzygies
- On the construction of staggered linear bases
- Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
- Syzygies, finite length modules, and random curves
- Using Algebraic Geometry
Cited in
(5)
This page was built for publication: A new algorithm for computing staggered linear bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687265)