Computing Final Polynomials and Final Syzygies Using Buchberger’s Gröbner Bases Method
- 1 May 1989
- journal article
- research article
- Published by Springer Nature in Results in Mathematics
- Vol. 15 (3-4) , 351-360
- https://doi.org/10.1007/bf03322623
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalenceJournal of Symbolic Computation, 1988
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- Bounds for the Degrees in the NullstellensatzAnnals of Mathematics, 1987
- Altshuler's Sphere M10425 is not PolytopalEuropean Journal of Combinatorics, 1987
- Using Gröbner bases to reason about geometry problemsJournal of Symbolic Computation, 1986
- On the real spectrum of a ring and its application to semialgebraic geometryBulletin of the American Mathematical Society, 1986
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal TheoryPublished by Springer Nature ,1985
- Some outstanding problems in the theory of matricesLinear and Multilinear Algebra, 1982
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Die Frage der endlich vielen Schritte in der Theorie der PolynomidealeMathematische Annalen, 1926