The Polynomial-Time Hierarchy

[1]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[2]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[3]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[4]  Robert E. Tarjan,et al.  A combinatorial problem which is complete in polynomial space , 1975, STOC.

[5]  J. Seiferas.  NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES , 1974 .

[6]  D. E. Knuth,et al.  Postscript about NP-hard problems , 1974, SIGA.

[7]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[8]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[9]  A. R. Meyer,et al.  Refinements of the Nondeterministic Time and Space Hierarchies , 1973, SWAT.

[10]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[11]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[12]  M. Paterson,et al.  A note on disjunctive form tautologies , 1973, SIGA.

[13]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[14]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[15]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[16]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[17]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[18]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[19]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[20]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[21]  Michael A. Harrison,et al.  Introduction to switching and automata theory , 1965 .

[22]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .