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

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.