On random hard sets for NP

  • Ronald V. Book
  • Osamu Watanabe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)

Abstract

The problem of whether NP has a random hard set (i.e., a set in RAND) is investigated. We show that for all recursive oracle A such that PA ≠ NPA, NPA has no hard set in RAND. On the other hand, we also show that for almost all oracle A, PA ≠ NPA and NPA has a hard set in RAND.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BDG88]
    J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1988.Google Scholar
  2. [BDG91]
    J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1991.Google Scholar
  3. [BG81]
    C. Bennett and J. Gill, Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1, SIAM J. Comput. 10 (1981), 96–113.CrossRefGoogle Scholar
  4. [BLW94]
    R. Book, J. Lutz, and K. Wagner, An observation on probability versus randomness with applications to complexity classes, Math. Systems Theory 26 (1994), 201–209.Google Scholar
  5. [Cha75]
    G. Chaitin, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22 (1975), 329–340.Google Scholar
  6. [JLL95]
    D. Juedes, J. Lathrop, and J. Lutz, Computational depth and reducibility, Theoret. Comput. Sci. (1995), to appear.Google Scholar
  7. [Lev74]
    L. Levin, Laws of information conservation (nongrowth) and aspects of the foundations of probability theory, Problems of Information Transmission 10 (1974), 206–210.Google Scholar
  8. [LV93]
    M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, 1993.Google Scholar
  9. [Mar66]
    P. Martin-Löf, On the definition of random sequences, Info. Control 9 (1966), 602–619.Google Scholar
  10. [Sch73]
    C. Schnorr, Process complexity and effective random tests, J. Computer System Sci. 7 (1973), 376–388.Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Ronald V. Book
    • 1
  • Osamu Watanabe
    • 2
  1. 1.Dept. of MathematicsUniversity of CaliforniaSanta BarbaraUSA
  2. 2.Dept. of Computer ScienceTokyo Institute of TechnologyTokyoJapan

Personalised recommendations