Complete sets and the polynomial-time hierarchy

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

The polynomial-time hierarchy

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

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 equivalence problem for regular expressions with squaring requires exponential space

Albert R. Meyer, Larry J. Stockmeyer · 1972 · 606 citations

Computing, Computer Science, Mathematics +6