Relativizations of the P=? NP and other problems: Some developments in structural complexity theory

  • Ronald V. Book
Session 4: Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)


The P =?NP problem has provided much of the primary motivation for developments in structural complexity theory. Recent results show that even after twenty years, contributions to the P=?NP problem, as well as other problems, still inspire new efforts. The purpose of this talk is to explain some of these results to theoreticians who do not work in structural complexity theory.


Polynomial Time Query Point Random Oracle Kolmogorov Complexity Membership Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BGS75]
    T. Baker, J. Gill, and R. Solovay. Relativizations of the P=? NP problem, SIAM J. Computing 4 (1975), 431–442.CrossRefGoogle Scholar
  2. [BDG88]
    J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, Springer-Verlag, 1988.Google Scholar
  3. [BDG90]
    J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II, Springer-Verlag, 1990.Google Scholar
  4. [BG81]
    C. Bennett and J. Gill. Relative to a random oracle, P ANP Aco-NP A with probability 1, SIAM J. Computing 10 (1981), 96–113.CrossRefGoogle Scholar
  5. [BH77]
    L. Berman and J. Hartmanis. On isomorphism and density of NP and other complete sets, SIAM J. Computing 6 (1977), 305–322.CrossRefGoogle Scholar
  6. [Boo91]
    R. Book. Some Observations on separating complexity classes, SIAM J. Computing 20 (1991), 246–258.CrossRefGoogle Scholar
  7. [BLS84]
    R. Book, T. Long, and A. Selman. Quantitative relativizations of complexity classes, SIAM J. Computing 13 (1984), 461–487.CrossRefGoogle Scholar
  8. [BLW92]
    R. Book, J. Lutz, and K. Wagner. On complexity classes and algorithmically random languages, STACS 92, Lecture Notes in Computer Sci., 577, Springer-Verlag (1992), 319–328.Google Scholar
  9. [Cai89]
    J.-Y. Cai. With proability one, a random oracle separates PSPACE from the polynomial-time hierarchy, J. Comput. Systems Sci. 38 (1989), 68–85.CrossRefGoogle Scholar
  10. [Cob64]
    A. Cobham. The intrinsic computational difficulty of functions, Prod. 1964 International Congress for Logic, Methodology and Philosophy of Science, North Holland (1964), 24–30.Google Scholar
  11. [Coo71]
    S. Cook. The complexity of theorem-proving procedures, Proc. 3rd ACM Symp. Theory of Computing (1971), 151–158.Google Scholar
  12. [GJ79]
    M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman & Co., 1979.Google Scholar
  13. [Kar72]
    R. Karp. Reducibility among combinatorial problems, in R. Miller and J. Thatcher (eds.), Complexity of Computer Computation, Plenum Press (1972), 85–104.Google Scholar
  14. [KL82]
    R. Karp and R. Lipton. Turing machines that take advice, L'Enseignement Mathématique 28 2nd series (1982), 191–209.Google Scholar
  15. [Kur83]
    S. Kurtz. On the random oracle hypothesis, Info. and Control 57 (1983), 40–47.CrossRefGoogle Scholar
  16. [Lev73]
    L. Levin. Universal sequential search problems, Probl. Pered. Inform. IX (1973), 115–116. English translation in Probl. Information Transmission 9 (1973), 265–266.Google Scholar
  17. [LV90]
    M. Li and P. Vitanyi. Kolmogorov complexity and its applications, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. A, Elsevier Sci. Publishers (1990), 187–254.Google Scholar
  18. [Mah82]
    S. Mahaney. Sparse complete sets for NP: solution of a conjecture by Berman and Hartmanis, J. Comput. and Systems Sci. 25 (1982), 130–143.CrossRefGoogle Scholar
  19. [ML66]
    P. Martin-Löf. On the definition of random sequences, Info. and Control 9 (1966), 602–619.Google Scholar
  20. [ML71]
    P. Martin-Löf. Complexity oscillations in infinite binary sequences, Zeitschrift für Wahrscheinlichkeitstheory und Verwandte Gebiete 19 (1971), 225–230.CrossRefGoogle Scholar
  21. [OL91]
    M. Ogiwara and A. Lozano. On one query self-reducible sets, Proc. 6th IEEE Conference on Structure in Complexity Theory (1991), 139–151.Google Scholar
  22. [OW91]
    M. Ogiwara and O. Watanabe. On polynomial bounded truth-table reducibility of NP sets to sparse sets, SIAM J. Computing 20 (1991), 471–483.CrossRefGoogle Scholar
  23. [Rog67]
    H. Rogers. Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.Google Scholar
  24. [Tra84]
    B. Trakhtenbrot. A survey of Russian approaches to Perebor (brute-force search) algorithms, Annals History of Computing 6 (1984), 384–399.Google Scholar
  25. [Wat87]
    O. Watanabe, A comparison of polynomial-time completeness notions, Theoret. Comput. Sci. 54 (1987), 249–265.CrossRefGoogle Scholar
  26. [Yao85]
    A. Yao. Separating the polynomial-time hierarchy by oracles, Proc. 26th IEEE Symp. Foundations of Comput. Sci. (1985), 1–10.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Ronald V. Book
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaSanta BarbaraUSA

Personalised recommendations