Separating classes in the exponential-time hierarchy from classes in PH

The polynomial-time hierarchy

Larry J. Stockmeyer · Theoretical Computer Science · 1976 · 1.3K citations

Alternation

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer · Journal of the ACM · 1981 · 1.2K citations · Full text

Computing, Computer Science, Mathematics +17

On the computational complexity of algorithms

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

Computing, Computer Science, Mathematics +15

Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

T. P. Baker, John Gill, Robert M Solovay · SIAM Journal on Computing · 1975 · 738 citations

Computing, Computer Science, Algorithms +10

Nondeterministic Space is Closed under Complementation

Neil Immerman · SIAM Journal on Computing · 1988 · 649 citations

Computing, Computer Science, Mathematics +11