Power from random strings

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 669-678

  Allender, Eric ^a   Buhrman, Harry ^b   Koucký, Michal ^a   Van Melkebeek, Dieter ^c   Ronneburger, Detlef ^a  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; TIME DOMAIN ANALYSIS;

KOLMOGOROV COMPLEXITY; RANDOM STRINGS; SPACE BOUNDED KOLMOGOROV MEASURE; TIME BOUNDED COMPLEXITY;

COMPUTER SCIENCE;

EID: 0036949739     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. M. Agrawal, E. Allender, R. Impagliazzo, R. Pitassi, and S. Rudich. Reducing the complexity of reductions. Comp. Compl., 10:117-138, 2001.
2. M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Available at: http://www.cse.iitk.ac.in/primality.pdf, 2002
3. M. Ajtai. Generating hard instances of lattice problems (extended abstract). In STOC, pages 99-108, 1996.
4. E. Allender. When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity. In FST&TCS, volume 2245 of LNCS, pages 1-15, 2001.
5. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Comp. Compl., 1:3-40, 1991.
6. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comp. Compl., 3:307-318, 1993.
7. P. Berman. Relationship between density and deterministic complexity of NP-complete languages. In ICALP, volume 62 of LNCS, pages 63-71, 1978.
8. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13:850-864, 1984.
9. H. Buhrman and E. Mayordomo, An excursion to the Kolmogorov random strings. JCSS, 54:393-399, 1997.
10. H. Buhrman and L. Torenvliet. Randomness is hard. SIAM J. Comput., 30: 1485-1501, 2001.
11. J.-Y. Cai. Some recent progress on the complexity of lattice problems. In CCC, pages 158-179, 1999.
12. J.-Y. Cai. On the average-case hardness of CVP. In FOCS, pages 308-319, 2001.
13. J.-Y. Cai and A. P. Nerurkar. An improved worst-case to average-case connection for lattice problems. In FOCS, pages 468-477, 1997.
14. J. Feigenbaum and L. Fortnow. On the random-self-reducibility of complete sets. SIAM J. Comput., 22:994-1005, 1993.
15. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33 (4):792-807, 1986.
16. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28:1364-1396, 1999.
17. R. Impagliazzo, S. Kabanets, and A. Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. In CCC, pages 2-12, 2001.
18. R. Impagliazzo and A. Wigderso. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In STOC '97, pages 220-229, 1997.
19. R. Impagliazzo and A. Wigderson. Randomness vs. time: de-randomization under a uniform assumption. In FOCS, pages 734-743, 1998.
20. V. Kabanets. Easiness assumptions and hardness tests: Trading time for zero error. JCSS, 63(2):236-252, 2001.
21. V. Kabanets and J.-Y. Cai. Circuit minimization problem. In STOC, pages 73-79, 2000.
22. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput., 2002, To apper; a preliminary version appeared in STOC'99.
23. K.-I. Ko. On the complexity of learning minimum time-bounded turing machines. SIAM J. Comput., 20:962-986, 1991.
24. M. Kummer. On the complexity of random strings. In STACS, volume 1046 of LNCS, pages 25-36, 1996.
25. R. Ladner and N. Lynch. Relativization of questions about log space reducibility. MST, 10:19-32, 1976.
26. R. E. Ladner. On the structure of polynomial time reducibility. J. ACM, 22:155-171, 1975.
27. L. A. Levin. Randomness conservation inequalities; information and independence in mathematical theories. Inf. and Control, 61:15-37, 1984.
28. M. Li and P. Vitanyi. Introduction to Kolmogorov Complexity and its Applications. Springer 1993.
29. D. Martin. Completeness, the recursion theorem and effectively simple sets. Proc. Am. Math. Soc., 17:838-842, 1966.
30. D. Micciancio. Improved cryptographic hash functions with worst-case / average-case connection. In STOC, pages 609-618, 2002.
31. N. Nisan and A. Wigderson. Hardness vs. randomness. JCSS, 49:149-167, 1994.
32. M. Rabin. Digitalized signatures and public-key functions as intractible as factorization. MIT Tech. Report TR-212, 1979.
33. A. A. Razborov and S. Rudich. Natural proofs. JCSS, 55:24-35, 1997.
34. S. Rudich. Super-bits, demi-bits, and NP̄/qpoly-natural proofs. In RANDOM, volume 1269 of LNCS, 1997.
35. M. Sipser. A complexity theoretic approach to randomness. In STOC, pages 330-335, 1983.
36. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. JCSS, 62:236-266, 2001.
37. L. Trevisan. Construction of extractors using pseudorandom generators. J. ACM, 48(4):860-879, 2001.
38. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In CCC, pages 129-138, 2002.
39. U. V. Vazirani and V. V. Vazirani. A natural encoding scheme proved probabilistic polynomial complete. TCS, 24:291-300, 1983.
40. O. Watanabe. A comparison of polynomial time completeness notions. TCS, 54:249-265, 1987.
41. O. Watanabe and S. Tang. On polynomial-time Turing and many-one completeness in PSPACE. TCS, 97:199-215, 1992.
42. A. Yao. Theory and applications of trapdoor functions. In FOCS, pages 80-91, 1982.