Generalization of the division algorithm and Gröbner bases
From MaRDI portal
Publication:6641483
DOI10.47234/MM.7903zbMATH Open1548.13067MaRDI QIDQ6641483
Publication date: 20 November 2024
Published in: Miscelánea Matemática (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- 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
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- On the computation of switching surfaces in optimal control: a Grobner basis approach
- Minimum distance functions of complete intersections
- Ideals, Varieties, and Algorithms
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
This page was built for publication: Generalization of the division algorithm and Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641483)
