Better pseudorandom generators from milder pseudorandom restrictions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 120-129

  Gopalan, Parikshit ^a   Meka, Raghu ^a   Reingold, Omer ^a   Trevisan, Luca ^b   Vadhan, Salil ^c  

^a MSR SVC ^*  (United States)

^b STANFORD UNIVERSITY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

branching programs; combinatorial rectangles; DNF formulas; Pseudorandom generators; random restrictions

Indexed keywords

BRANCHING PROGRAMS; COMBINATORIAL RECTANGLES; DNF FORMULAS; PSEUDORANDOM GENERATORS; RANDOM RESTRICTIONS;

COMPUTER SCIENCE;

EID: 84871999861     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.77     Document Type: Conference Paper

References (46)

1. R. Impagliazzo and A. Wigderson, "P = BPP if E requires exponential circuits: Derandomizing the XOR lemma," in STOC, 1997, pp. 220-229.
2. N. Nisan, "Pseudorandom bits for constant depth circuits," Combinatorica, vol. 11, no. 1, pp. 63-70, 1991.
3. -, "Pseudorandom generators for space-bounded computation," Combinatorica, vol. 12, no. 4, pp. 449-461, 1992.
4. P. Indyk, "Stable distributions, pseudorandom generators, embeddings, and data stream computation," J. ACM, vol. 53, no. 3, pp. 307-323, 2006.
5. D. Sivakumar, "Algorithmic derandomization via complexity theory," in IEEE Conference on Computational Complexity, 2002, p. 10.
6. L. Trevisan, "Extractors and pseudorandom generators," J. ACM, vol. 48, no. 4, pp. 860-879, 2001.
7. L. E. Celis, O. Reingold, G. Segev, and U. Wieder, "Balls and bins: Smaller hash families and faster evaluation," in FOCS, 2011, pp. 599-608.
8. A. Healy, S. P. Vadhan, and E. Viola, "Using nondeterminism to amplify hardness," SIAM J. Comput., vol. 35, no. 4, pp. 903-931, 2006.
9. E. Kaplan, M. Naor, and O. Reingold, "Derandomized constructions of k-wise (almost) independent permutations," in APPROX-RANDOM, 2005, pp. 354-365.
10. I. Haitner, D. Harnik, and O. Reingold, "On the power of the randomized iterate," in Advances in Cryptology-CRYPTO '06, ser. Lecture Notes in Computer Science, C. Dwork, Ed. Springer-Verlag, 2006.
11. 3/2)," J. Comput. Syst. Sci., vol. 58, no. 2, pp. 376-403, 1999.
12. R. Impagliazzo, N. Nisan, and A. Wigderson, "Pseudorandomness for network algorithms," in STOC, 1994, pp. 356-364.
13. N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comput. Syst. Sci., vol. 52, no. 1, pp. 43-52, 1996.
14. R. Raz and O. Reingold, "On recycling the randomness of states in space bounded computation," in STOC, 1999, pp. 159-168.
15. O. Reingold, "Undirected connectivity in log-space," J. ACM, vol. 55, no. 4, pp. Art. 17, 24, 2008.
16. O. Reingold, L. Trevisan, and S. Vadhan, "Pseudorandom walks in regular digraphs and the RL vs. L problem," in STOC, 2006, pp. 457-466.
17. M. Braverman, A. Rao, R. Raz, and A. Yehudayoff, "Pseudorandom generators for regular branching programs," in FOCS, 2010, pp. 40-47.
18. J. Brody and E. Verbin, "The coin problem and pseudorandomness for branching programs," in FOCS, 2010, pp. 30-39.
19. M. Koucký, P. Nimbhorkar, and P. Pudlák, "Pseudorandom generators for group products: extended abstract," in STOC. ACM, 2011, pp. 263-272.
20. A. De, "Pseudorandomness for permutation and regular branching programs," in IEEE Conference on Computational Complexity. IEEE Computer Society, 2011, pp. 221-231.
21. M. Saks and D. Zuckerman, 1995, unpublished manuscript.
22. J. Síma and S. Zák, "Almost k-wise independent sets establish hitting sets for width-3 1-branching programs," in CSR, 2011, pp. 120-133.
23. L. M. J. Bazzi, "Polylogarithmic independence can fool DNF formulas," SIAM J. Comput., vol. 38, no. 6, pp. 2220-2272, 2009.
24. A. Razborov, "A simple proof of Bazzis theorem," ACM Trans. Comput. Theory, vol. 1, no. 1, pp. 3:1-3:5, Feb. 2009.
25. A. De, O. Etesami, L. Trevisan, and M. Tulsiani, "Improved pseudorandom generators for depth 2 circuits," in APPROX-RANDOM, 2010, pp. 504-517.
26. A. R. Klivans, H. K. Lee, and A. Wan, "Mansour's conjecture is true for random DNF formulas," in COLT, 2010, pp. 368- 380.
27. R. Armoni, M. E. Saks, A. Wigderson, and S. Zhou, "Discrepancy sets and pseudorandom generators for combinatorial rectangles," in FOCS, 1996, pp. 412-421.
28. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic, "Efficient approximation of product distributions," Random Struct. Algorithms, vol. 13, no. 1, pp. 1-16, 1998.
29. N. Linial, M. Luby, M. E. Saks, and D. Zuckerman, "Efficient construction of a small hitting set for combinatorial rectangles in high dimension," Combinatorica, vol. 17, no. 2, pp. 215-234, 1997.
30. C.-J. Lu, "Improved pseudorandom generators for combinatorial rectangles," Combinatorica, vol. 22, no. 3, pp. 417-434, 2002.
31. E. Viola, "The sum of d small-bias generators fools polynomials of degree d," in IEEE Conference on Computational Complexity, 2008, pp. 124-127.
32. J. Naor and M. Naor, "Small-bias probability spaces: Efficient constructions and applications," SIAM J. Comput., vol. 22, no. 4, pp. 838-856, 1993.
33. N. Alon, O. Goldreich, J. Håstad, and R. Peralta, "Simple construction of almost k-wise independent random variables," Random Struct. Algorithms, vol. 3, no. 3, pp. 289-304, 1992.
34. A. Bogdanov and E. Viola, "Pseudorandom bits for polynomials," SIAM J. Comput., vol. 39, no. 6, pp. 2464-2486, 2010.
35. S. Lovett, "Unconditional pseudorandom generators for low degree polynomials," in STOC, 2008, pp. 557-562.
36. A. Bogdanov, Z. Dvir, E. Verbin, and A. Yehudayoff, " Pseudorandomness for width 2 branching programs," Electronic Colloquium on Computational Complexity (ECCC), vol. 16, p. 70, 2009.
37. L. G. Valiant, "Graph-theoretic arguments in low-level complexity," in Mathematical foundations of computer science (Proc. Sixth Sympos., Tatranská Lomnica, 1977). Berlin: Springer, 1977, pp. 162-176. Lecture Notes in Comput. Sci., Vol. 53.
38. C.-J. Lu, S.-C. Tsai, and H.-L. Wu, "Improved hardness amplification in np," Theor. Comput. Sci., vol. 370, no. 1-3, pp. 293-298, 2007.
39. 2-formula on finite structures," Ann. Pure. Appl. Logic, vol. 24, pp. 1-48, 1983.
40. M. L. Furst, J. B. Saxe, and M. Sipser, "Parity, circuits, and the polynomial-time hierarchy," Mathematical Systems Theory, vol. 17, no. 1, pp. 13-27, 1984.
41. J. Håstad, "Almost optimal lower bounds for small depth circuits," in STOC, 1986, pp. 6-20.
42. M. Ajtai and A. Wigderson, "Deterministic simulation of probabilistic constant depth circuits," in FOCS, 1985, pp. 11-19.
43. M. Agrawal, E. Allender, R. Impagliazzo, T. Pitassi, and S. Rudich, "Reducing the complexity of reductions," IEEE Conference on Computational Complexity, vol. 10, no. 2, pp. 117-138, 2001.
44. P. Gopalan, R. Meka, and O. Reingold, "DNF sparsification and a faster deterministic counting algorithm," in IEEE Conference on Computational Complexity, 2012.
45. M. Ben-Or and N. Linial, "Collective coin flipping, robust voting schemes and minima of banzhaf values," in FOCS, 1985, pp. 408-416.
46. D. Cox, J. Little, and D. O'Shea, Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, 2007.