Concepedia

The complexity of the word problems for commutative semigroups and polynomial ideals

Ernst Mayr, Albert R. Meyer

Advances in Mathematics · 1982 · 506 citations · 21 references

DOIFull text

Open access

Concepts

References

21

Introduction to automata theory, languages and computation

Mathematics and Computers in Simulation · 1981 · 10.9K citations

, , +10

Introduction to automata theory, languages, and computation

Computer Languages · 1980 · 6.9K citations

, , +10

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

, , +17

Relationships between nondeterministic and deterministic tape complexities

Walter J. Savitch · Journal of Computer and System Sciences · 1970 · 1.4K citations

, , +5

On the computational complexity of algorithms

Juris Hartmanis, Richard E. Stearns · Transactions of the American Mathematical Society · 1965 · 957 citations · Full text

, , +15