On the complexity of computing syzygies
Open Access
- 1 October 1988
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 6 (2-3) , 135-147
- https://doi.org/10.1016/s0747-7171(88)80039-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bounds for the Degrees in the NullstellensatzAnnals of Mathematics, 1987
- A Castelnuovo bound for smooth surfacesInventiones Mathematicae, 1986
- Linear free resolutions and minimal multiplicityJournal of Algebra, 1984
- On a theorem of Castelnuovo, and the equations defining space curvesInventiones Mathematicae, 1983
- Fields of large transcendence degree generated by values of elliptic functionsInventiones Mathematicae, 1983
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- Constructions in algebraTransactions of the American Mathematical Society, 1974
- Die Frage der endlich vielen Schritte in der Theorie der PolynomidealeMathematische Annalen, 1926