The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2) , 581-594
- https://doi.org/10.1137/0215042
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the complexity of the Gröbner-bases algorithm over K[x,y,z]Published by Springer Nature ,2005
- Upper and lower bounds for the degree of Groebner basesPublished by Springer Nature ,2005
- Symmetric space-bounded computationPublished by Elsevier ,2002
- Gröbner Bases and Systems TheoryMultidimensional Systems and Signal Processing, 2001
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- Constructions in algebraTransactions of the American Mathematical Society, 1974
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Rational sets in commutative monoidsJournal of Algebra, 1969
- Die Frage der endlich vielen Schritte in der Theorie der PolynomidealeMathematische Annalen, 1926