A note on the complexity of constructing Gröbner-bases
- 1 January 1983
- book chapter
- Published by Springer Nature
- p. 137-145
- https://doi.org/10.1007/3-540-12868-9_98
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Generalized Polynomial Remainder SequencesPublished by Springer Nature ,1982
- Algebraic SimplificationPublished by Springer Nature ,1982
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their dualsIEEE Transactions on Information Theory, 1981
- Über B. Buchbergers verfahren, systeme algebraischer gleichungen zu lösenJournal of Number Theory, 1978
- Some properties of Gröbner-bases for polynomial idealsACM SIGSAM Bulletin, 1976
- A theoretical basis for the reduction of polynomials to canonical formsACM SIGSAM Bulletin, 1976
- Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)Published by Association for Computing Machinery (ACM) ,1976
- Constructions in algebraTransactions of the American Mathematical Society, 1974
- 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