Pseudorandom generators and typically-correct derandomization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 574-587

  Kinne, Jeff ^a   Van Melkebeek, Dieter ^a   Shaltiel, Ronen ^b  

^a University of Wisconsin   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCUIT LOWER BOUNDS; DERANDOMIZATION; DETERMINISTIC SIMULATION; ERROR RATE; GENERIC APPROACH; POLYNOMIAL-TIME SIMULATIONS; PSEUDORANDOM GENERATORS; RANDOMIZED ALGORITHMS; RANDOMNESS EXTRACTORS;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; COMPUTER SIMULATION LANGUAGES; CONTROL THEORY; ELEMENTARY PARTICLE SOURCES; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350596828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_43     Document Type: Conference Paper

References (24)

1. Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. JCSS 45(2), 204-232 (1992)
2. Feigenbaum, J., Fortnow, L.: Random-self-reducibility of complete sets. SICOMP 22(5) (1993)
3. Goldreich, O., Wigderson, A.: Derandomization that is rarely wrong from short advice that is typically good. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 209-223. Springer, Heidelberg (2002)
4. Gutfreund, D., Shaltiel, R., Ta-Shma, A.: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Comput. Compl. 12(3-4), 85-130 (2003)
5. Håstad, J.: Computational limitations of small-depth circuits. MIT Press, Cambridge (1987)
6. Impagliazzo, R., Kabanets, V., Wigderson, A.: In search of an easy witness: exponential time vs. probabilistic polynomial time. JCSS 65(4), 672-694 (2002)
7. Impagliazzo, R., Wigderson, A.: Randomness vs time: Derandomization under a uniform assumption. JCSS 63(4), 672-688 (2001)
8. Kabanets, V.: Easiness assumptions and hardness tests: Trading time for zero error. JCSS 63(2), 236-252 (2001)
9. Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Compl. 13(1/2), 1-46 (2004)
10. Kannan, R.: Circuit-size lower bounds and nonreducibility to sparse sets. Inf. Cont. 55(1), 40-56 (1982)
11. Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SICOMP 31(5), 1501-1526 (2002)
12. Miltersen, P.B.: Derandomizing complexity classes. In: Handbook of Randomized Computing, pp. 843-941. Kluwer Academic Publishers, Dordrecht (2001)
13. Nisan, N.: On read-once vs. multiple access to randomness in logspace. Theor. Comp. Sci. 107(1), 135-144 (1993)
14. Nisan, N., Wigderson, A.: Hardness vs. randomness. JCSS 49(2), 149-167 (1994)
15. Reingold, O.: Undirected connectivity in log-space. JACM 55(4) (2008)
16. Shaltiel, R.: Weak derandomization of weak algorithms: explicit versions of Yao's lemma. In: Proc. Conf. Comput. Compl. (2009)
17. Shaltiel, R., Umans, C.: Low-end uniform hardness vs. randomness tradeoffs for AM. In: Proc. of the ACM Symp. Theory of Comp., pp. 430-439 (2007)
18. Toda, S.: PP is as hard as the polynomial-time hierarchy. SICOMP 20(5), 865-877 (1991)
19. Trevisan, L.: Extractors and pseudorandom generators. JACM 48(4), 860-879 (2001)
20. Trevisan, L., Vadhan, S.P.: Pseudorandomness and average-case complexity via uniform reductions. Comput. Compl. 16(4), 331-364 (2007)
21. Viola, E.: Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates. SICOMP 36(5), 1387-1403 (2006)
22. Zanko, V.: #P-completeness via many-one reductions. Intl. J. Found. Comp. Sci. 2(1), 77-82 (1991)
23. Zimand, M.: Exposure-resilient extractors. In: Proc. Conf. Comput. Compl., pp. 61-72 (2006)
24. Zimand, M.: Exposure-resilient extractors and the derandomization of probabilistic sublinear time. Comput. Compl. 17(2), 220-253 (2008)