Distributionally hard languages

Theory of Computing Systems

Volumn 34, Issue 3, 2001, Pages 245-261

  Fortnow, L ^a   Pavan, A ^b   Selman, A L ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARD LANGUAGES; KOLMOGOROV COMPLEXITY; ONE-WAY FUNCTIONS; POLYNOMIAL-TIME;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

POLYNOMIAL APPROXIMATION;

EID: 0035634529     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240011003     Document Type: Article

References (31)

1. E. Allender and R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17(6):1193-1202, 1988.
2. K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In A. Sorbi, editor, Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics 187, pages 1-47. Marcel Dekker, New York, 1997.
3. K. Ambos-Spies, S. Terwijn, and X. Zheng. Resource bounded randomness and weakly complete problems. Theoretical Computer Science, 172(1-2):195-207, 1997.
4. J. Balcázar, R. Book, and U. Schöning. The polynomial-time hierarchy and sparse oracles. Journal of the Assocociation for Computing Machinery, 33(3):603-617, 1986.
5. R. Book. Tally languages and complexity classes. Information and Control, 26:186-193, 1974.
6. J. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18(1):1-10, 1985.
7. J.-Y. Cai and A. Selman. Fine separation of average time complexity classes. SIAM Journal on Computing, 28(4): 1310-1325, 1999.
8. L. Fortnow. Relativized worlds with an infinite hierarchy. Information Processing Letters, 69(6):309-313, 1999.
9. Y. Gurevich. Average case completeness. Journal of Computer and System Sciences, 42:346-398, 1991.
10. G. Hardy. Orders of Infinity, The "infinitärcalcül" of Paul du Bois-Reymond, Cambridge Tracts in Mathematics and Mathematical Physics, volume 12. Cambridge University Press, London, 2nd edition, 1924.
11. J. Håstad. Almost optimal lower bounds for small depth circuits. In S. Micali, editor, Randomness and Computation, Advances in Computing Research, volume 5, pages 143-170. JAI Press, Greenwich, CT, 1989.
12. J. Hartmanis, N. Immerman, and V. Sewelson. Sparse sets in NP-P: EXPTIME versus NEXPTIME. Information and Control, 65:158-181, 1985.
13. L. Hemaspaandra and S. Jha. Defying upward and downward separation. Information and Computation, 121(1):1-13, 1995.
14. L. Hemaspaandra, J. Rothe, and G. Wechsung. Easy sets and hard certificate schemes. Acta Informatica, 34(11):859-879, 1997.
15. J. Hartmanis and Y. Yesha. Computation times of NP sets of different densities. Theoretical Computer Science, 34:17-32, 1984.
16. R. Impagliazzo. A personal view of average-case complexity. In Proceedings of the Tenth Annual IEEE Conference on Structure in Complexity Theory, pages 134-147, 1995.
17. R. Impagliazzo and G. Tardos. Search versus decision in super-polynomial time. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 222-227, 1989.
18. 2. Theoretical Computer Science, 143:149-158, 1995.
19. K. Ko and H. Friedman. Computational complexity of real functions. Theoretical Computer Science, 20:323-352, 1982.
20. S. Kautz and P. Miltersen. Relative to a random oracle, NP is not small. Journal of Computer and System Sciences, 53(2):235-250, 1996.
21. L. Levin. Average case complete problems. SIAM Journal on Computing, 15:285-286, 1986.
22. J. Lutz and E. Mayordomo. Cook vs. Karp-Levin: separating completeness notions if NP is not small. Theoretical Computer Science, 23:762-779, 1996.
23. J. Lutz. Almost every where high nonuniform complexity. Journal of Computer and System Sciences, 44:220-258, 1992.
24. J. Lutz. The quantitative structure of exponential time. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, chapter 10, pages 225-260. Springer-Verlag, New York, 1997.
25. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Graduate Texts in Computer Science. Springer-Verlag, New York, second edition, 1997.
26. E. Mayordomo. Almost every set in exponential time is P-bi-immune. Theoretical Computer Science, 136:487-506, 1994.
27. A. Pavan and A. Selman. Complete distributional problems, hard languages, and resource-bounded measure. Theoretical Computer Science, 234(1-2):273-286, 2000.
28. A. Selman. A survey of one-way functions in complexity theory. Mathematical Systems Theory, 25:203-221, 1992.
29. R. Schuler and T. Yamakami. Sets computable in polynomial time on the average. In Proceedings of the First Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, volume 959, pages 650-661. Springer-Verlag, Berlin, 1995.
30. J. Wang. Average-case computational complexity theory. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 295-328. Springer-Verlag, New York, 1997.
31. A. Yao. Separating the polynomial-time hierarchy by oracles. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 1-10, 1985.