Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds

Computational Complexity

Volumn 21, Issue 1, 2012, Pages 3-61

  Kinne, Jeff ^a   van Melkebeek, Dieter ^b   Shaltiel, Ronen ^c  

^a INDIANA STATE UNIVERSITY   (United States)

^b University of Wisconsin   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

circuit lower bounds; pseudorandom generators; randomized algorithms; Typically correct derandomization

Indexed keywords

EID: 84859047390     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-011-0019-z     Document Type: Article

References (42)

1. Scott Aaronson Dieter van Melkebeek (2010). A note on circuit lower bounds from derandomization. Electronic Colloquium on Computational Complexity (ECCC), 17(105).
2. Aaronson Scott, Wigderson Avi (2009) Algebrization: A new barrier in complexity theory. ACM Transactions on Computation Theory, 1(1): 1-54.
3. László Babai, Lance Fortnow, Leonid A. Levin & Mario Szegedy (1991). Checking computations in polylogarithmic time. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 21-31.
4. László Babai, Lance Fortnow, Noam Nisan & Avi Wigderson (1993). BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3, 307-318.
5. Babai LáSzló, Fortnow Lance, Nisan Noam, Wigderson Avi (1993) BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity 3: 307-318.
6. Aviad Cohen & Avi Wigderson (1989). Dispersers, deterministic amplification, & weak random sources (extended abstract). In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 14-19.
7. Oded Goldreich, Noam Nisan & Avi Wigderson (1995). On Yao's XOR-lemma. Electronic Colloquium on Computational Complexity (ECCC), 2(50).
8. Oded Goldreich & Avi Wigderson (2000). On pseudorandomness with respect to deterministic observers. In Carleton Scientific, editor, International Colloquium on Automata, Languages and Programming (ICALP), pages 77-84.
9. Oded Goldreich & Avi Wigderson (2002). Derandomization that is rarely wrong from short advice that is typically good. In Proceedings of the International Workshop on Randomization and Computation (RANDOM), pages 209-223.
10. Gutfreund Dan, Shaltiel Ronen, Ta-Shma Amnon (2003) Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130.
11. Håstad Johan (1987) Computational limitations of small-depth circuits. MIT Press, Cambridge, MA, USA.
12. Impagliazzo Russell, Kabanets Valentine, Wigderson Avi (2002) In search of an easy witness: exponential time vs probabilistic polynomial time. Journal of Computer and System Sciences 65(4): 672-694.
13. Russell Impagliazzo (1995). Hard-core distributions for somewhat hard problems. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 538-545.
14. Russell Impagliazzo & Avi Wigderson (1997). P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 220-229.
15. Impagliazzo Russell, Wigderson Avi (2001) Randomness vs time: Derandomization under a uniform assumption. Journal of Computer and System Sciences 63(4): 672-688.
16. Russell Impagliazzo & David Zuckerman (1989). How to recycle random bits. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 248-253.
17. Kabanets Valentine (2001) Easiness assumptions and hardness tests: Trading time for zero error. Journal of Computer and System Sciences 63(2): 236-252.
18. Kabanets Valentine, Impagliazzo Russell (2004) Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13(1/2): 1-46.
19. Kannan Ravi (1982) Circuit-size lower bounds and nonreducibility to sparse sets. Information and Control 55(1): 40-56.
20. Klivans Adam R., van Melkebeek Dieter (2002) Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing 31(5): 1501-1526.
21. van Melkebeek Dieter, Santhanam Rahul (2005) Holographic proofs and derandmization. SIAM Journal on Computing 35(1): 59-90.
22. Peter Bro Miltersen (2001). Derandomizing complexity classes. In Handbook of Randomized Computing, pages 843-941. Kluwer Academic Publishers.
23. Miltersen Peter Bro, Vinodchandran N. V. (2005) Derandomizing Arthur-Merlin games using hitting sets. Computational Complexity 14(3): 256-279.
24. Newman Ilan (1991) Private vs common random bits in communication complexity. Information Processing Letters 39(2): 67-71.
25. Nisan Noam (1991) Pseudorandom bits for constant depth circuits. Combinatorica 11(1): 63-70.
26. Nisan Noam (1993) On read-once vs multiple access to randomness in logspace. Theoretical Computer Science 107(1): 135-144.
27. Nisan Noam, Wigderson Avi (1994) Hardness vs randomness. Journal of Computer and System Sciences 49(2): 149-167.
28. Omer Reingold (2008). Undirected connectivity in log-space. Journal of the ACM, 55(4).
29. Ronen Shaltiel (2009). Weak derandomization of weak algorithms: explicit versions of Yao's lemma. In Proceedings of the IEEE Conference on Computational Complexity.
30. Shaltiel Ronen, Umans Christopher (2005) Simple extractors for all min-entropies and a new pseudorandom generator. Journal of the ACM 52(2): 172-216.
31. Shaltiel Ronen, Umans Christopher (2006) Pseudorandomness for approximate counting and sampling. Computational Complexity 15(4): 298-341.
32. Ronen Shaltiel & Christopher Umans (2007). Low-end uniform hardness vs. randomness tradeoffs for AM. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 430-439.
33. Shamir Adi (1992) IP = PSPACE. Journal of the ACM 39(4): 869-877.
34. 3/2). Journal of Computer and System Sciences 58(2): 376-403.
35. Toda Seinosuke (1991) PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20(5): 865-877.
36. Trevisan Luca, Vadhan Salil P. (2007) Pseudorandomness and average-case complexity via uniform reductions. Computational Complexity 16(4): 331-364.
37. Viola Emanuele (2005) The complexity of constructing pseudorandom generators from hard functions. Computational Complexity 13(3-4): 147-188.
38. Viola Emanuele (2006) Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates. SIAM Journal on Computing 36(5): 1387-1403.
39. Wilson Christopher B. (1985) Relativized circuit complexity. Journal of Computer and System Sciences 31(2): 169-181.
40. Zanko Viktoria (1991) #P-completeness via many-one reductions. International Journal of Foundations of Computer Science 2(1): 77-82.
41. Marius Zimand (2006). Exposure-resilient extractors. In Proceedings of the IEEE Conference on Computational Complexity, pages 61-72.
42. Zimand Marius (2008) Exposure-resilient extractors and the derandomization of probabilistic sublinear time. Computational Complexity, 17(2): 220-253.