Hard sets are hard to find

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 170-181

  Buhrman, H ^a   Van Melkebeek, D ^b  

^a CWI   (Netherlands)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

COMPLETE SETS; COMPLEXITY CLASS; P REDUCTION; P-COMPLETE; POLYNOMIAL-TIME HIERARCHY; POLYNOMIAL-TIME REDUCTION; RESOURCE-BOUNDED MEASURE; SMALL SPAN THEOREM;

COMPUTATIONAL COMPLEXITY;

EID: 84947236432     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694602     Document Type: Conference Paper

References (24)

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