Complete sets and the polynomial-time hierarchy

This publication has 9 references indexed in Scilit:

• Theodore Baker, John Gill, and Robert Solovay. Relativizations of the = ? question. SIAM journal on computing, vol. 4 (1975), pp. 431–442. - Charles H. Bennett and John Gill. Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1. SIAM journal on computing, vol. 10 (1981), pp. 96–113.
  The Journal of Symbolic Logic, 1986
• Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–
  ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
• The polynomial-time hierarchy
  Theoretical Computer Science, 1976
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
  SIAM Journal on Computing, 1975
• Space-bounded reducibility among combinatorial problems
  Journal of Computer and System Sciences, 1975
• Word problems requiring exponential time(Preliminary Report)
  Published by Association for Computing Machinery (ACM) ,1973
• The equivalence problem for regular expressions with squaring requires exponential space
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Time- and tape-bounded turing acceptors and AFLs
  Journal of Computer and System Sciences, 1970