Tally languages and complexity classes

Relationships between nondeterministic and deterministic tape complexities

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

Computing, Computer Science, Algorithms +5

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Stephen Cook · Journal of the ACM · 1971 · 362 citations · Full text

Computing, Computer Science, Computer Architecture +6

On non-determinancy in simple computing devices

Juris Hartmanis · Acta Informatica · 1972 · 111 citations

Computing, Computer Science, Computer Systems +9

On Languages Accepted in Polynomial Time

Ronald V. Book · SIAM Journal on Computing · 1972 · 55 citations

Computing, Computer Science, Mathematics +17

Comparing complexity classes

Ronald V. Book · Journal of Computer and System Sciences · 1974 · 50 citations