The complexity of the word problems for commutative semigroups and polynomial ideals
- 1 December 1982
- journal article
- Published by Elsevier in Advances in Mathematics
- Vol. 46 (3) , 305-329
- https://doi.org/10.1016/0001-8708(82)90048-2
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- The Complexity of the Finite Containment Problem for Petri NetsJournal of the ACM, 1981
- ON THE ISOMORPHISM PROBLEM FOR COMMUTATIVE SEMIGROUPSMathematics of the USSR-Sbornik, 1974
- On Effective Procedures for Speeding Up AlgorithmsJournal of the ACM, 1971
- Counter machines and counter languagesTheory of Computing Systems, 1968
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- On the L-Homomorphisms of Finite GroupsTransactions of the American Mathematical Society, 1951
- Recursive Unsolvability of a problem of ThueThe Journal of Symbolic Logic, 1947
- Die Frage der endlich vielen Schritte in der Theorie der PolynomidealeMathematische Annalen, 1926
- Ueber die Theorie der algebraischen FormenMathematische Annalen, 1890