Parity, circuits, and the polynomial-time hierarchy

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

Word problems requiring exponential time(Preliminary Report)

Larry J. Stockmeyer, Albert R. Meyer · 1973 · 874 citations

Computing, Computer Science, Mathematics +13

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

The complexity of computing

Mathematics and Computers in Simulation · 1979 · 262 citations

Computing, Computer Science, Mathematics +9