We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals

Thumbnail Image
Download
Name

MIT-LCS-TM-199.pdf

Size

4.87 MB

Format

Adobe PDF

Checksum (MD5)

acff74787f7b374bb75a47349e5e2565

Author(s)
Mayr, Ernst W.
•
Meyer, Albert R.
Date Issued
June 1981
Series/Report no.
MIT-LCS-TM-199
Abstract
Any decision procedure for the word problems for commutative semigroups and polynomial ideals inherently requires computational storage space growing exponentially with the size of the problem instrance to which the procedure is applied. This bound is achieved by a simple procedure for the semigroup problem.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.