Hard sets are hard to find

Journal of Computer and System Sciences

Volumn 59, Issue 2, 1999, Pages 327-345

  Buhrman, Harry ^a   Van Melkebeek, Dieter ^b  

^a CWI   (Netherlands)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; SET THEORY;

SMALL SPAN THEOREM;

COMPUTATIONAL COMPLEXITY;

EID: 0032597109     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1650     Document Type: Article

References (25)

1. Allender E., Strauss M. Measure on small complexity classes, with applications for BPP. Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. 1994;IEEE Press, New York. p. 807-818.
2. Ambos-Spies K., Bentzien L. Separating NP-completeness notions under strong hypothesis. Proceedings of the 12th IEEE Conference on Computational Complexity. 1997;IEEE Press, New York. p. 121-127.
3. K. Ambos-Spies, S. Lempp, and, G. Mainhardt, Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets, manuscript, March 1998.
4. Ambos-Spies K., Neis H.-C., Terwijn S. Genericity and measure for exponential time. Theoret. Comput. Sci. 168:1996;3-19.
5. Babai L., Fortnow L., Nisan N., Wigderson A. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Complexity. 3:1993;307-318.
6. Balcázar J., Díaz J., Gabarró J. Structural Complexity II. EATCS Monographs on Theoretical Computer Science. 22:1990;Springer-Verlag, New York/Berlin.
7. Balcázar J., Díaz J., Gabarró J. Structural Complexity I. EATCS Monographs on Theoretical Computer Science. 11:1995;Springer-Verlag, New York/Berlin.
8. A with probability one. SIAM J. Comput. 10:1981;96-113.
9. Buhrman H., Longpré L. Compressibility and resource bounded measure. Proceedings of the 13th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1046:1996;Springer-Verlag, New York/Berlin. p. 13-24.
10. Buhrman H., Mayordomo E. An excursion to the Kolmogorov random strings. Proceedings of the 10th IEEE Structure in Complexity Theory Conference. 1995;IEEE Press, New York. p. 197-205.
11. Buhrman H., van Melkebeek D. Hard sets are hard to find. Proceedings of the 13th IEEE Conference on Computational Complexity. 1998;IEEE Press, New York. p. 170-180.
12. Buhrman H., van Melkebeek D., Regan K., Sivakumar D., Strauss M. A generalization of resource-bounded measure, with an application. Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1373:1998;Springer-Verlag, New York/Berlin. p. 161-171.
13. Heller H. On relativized exponential and probabilistic complexity classes. Inform. and Comput. 71:1986;231-243.
14. Juedes D., Lutz J. The complexity and distribution of hard problems. SIAM J. Comput. 24:1995;279-295.
15. L. Longpré, personal communication, 1997.
16. Lutz J. Category and measure in complexity classes. SIAM J. Comput. 19:1990;1100-1131.
17. Lutz J. Almost everywhere high nonuniform complexity. J. Comput. System Sci. 44:1992;220-258.
18. Lutz J. A small span theorem for P/poly-Turing reductions. Proceedings of the 10th IEEE Structure in Complexity Theory Conference. 1995;IEEE Press, New York. p. 324-330.
19. 2. Proceedings of the 13th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1046:1996;Springer-Verlag, New York/Berlin. p. 87-97.
20. Lutz J., Mayordomo E. Measure, stochasticity, and the density of hard languages. SIAM J. Comput. 23:1994;762-779.
21. Lutz J., Mayordomo E. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoret. Comp. Sci. 164:1996;141-163.
22. Mayordomo E. Almost every set in exponential time is P-bi-immune. Theoret. Comput. Sci. 136:1994;487-506.
23. Nisan N., Wigderson A. Hardness vs. randomness. J. Comput. System Sci. 49:1994;149-167.
24. Papadimitriou C. Computational Complexity. 1994;Addison-Wesley, Reading.
25. Regan K., Sivakumar D., Cai J. Pseudorandom generators, measure theory, and natural proofs. Proceedings of the 36th IEEE Symposium on Foundations of Computer Science. 1995;IEEE Press, New York. p. 26-35.