A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
Open Access
- 31 March 1986
- journal article
- Published by Elsevier in Information and Control
- Vol. 68 (1-3) , 196-206
- https://doi.org/10.1016/s0019-9958(86)80035-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal TheoryPublished by Springer Nature ,1985
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- New decision algorithms for finitely presented commutative semigroupsComputers & Mathematics with Applications, 1981
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Rational sets in commutative monoidsJournal of Algebra, 1969