Pseudorandom generators for combinatorial shapes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 253-262

  Gopalan, Parikshit ^a   Meka, Raghu ^b   Reingold, Omer ^a   Zuckerman, David ^b  

^a MSR SVC   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

branching programs; limit theorems; pseudorandom generators; small space

Indexed keywords

COMPUTATION THEORY;

BINOMIAL DISTRIBUTION; BRANCHING PROGRAMS; CENTRAL LIMIT THEOREM; KOLMOGOROV DISTANCE; LIMIT THEOREM; PSEUDORANDOM GENERATORS; SMALL SPACE; STATISTICAL DISTANCE;

COMPUTATIONAL COMPLEXITY;

EID: 79959763993     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993671     Document Type: Conference Paper

References (26)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289-303, 1992.
2. R. Armoni, M. Saks, A. Wigderson, and S. Zhou. Discrepancy sets and pseudorandom generators for combinatorial rectangles. In FOCS '96, pages 412-421, 1996.
3. Louay M. J. Bazzi. Polylogarithmic independence can fool DNF formulas. SIAM J. Comput., 38(6):2220-2272, 2009.
4. A. D. Barbour and V. Cekanavičius. Total variation asymptotics for sums of independent integer random variables. The Annals of Probability, 30(2):509-545, 2002.
5. Andrew D. Barbour and Aihua Xia. Poisson perturbations. ESAIM, 3:131-150, october 1999.
6. Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, and Emanuele Viola. Bounded independence fools halfspaces. SIAM J. Comput., 39(8):3441-3462, 2010.
7. Constantinos Daskalakis and Christos H. Papadimitriou. Computing equilibria in anonymous games. In FOCS '07, pages 83-93, 2007.
8. Constantinos Daskalakis and Christos H. Papadimitriou. Discretized multinomial distributions and Nash equilibria in anonymous games. In FOCS'08, pages 23-34, 2008.
9. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Veličkovič . Approximations of general independent distributions. In STOC '92, pages 10-16, 1992.
10. William Feller. An Introduction to Probability Theory and Its Applications, Vol. 2 (Volume 2). Wiley, 2 edition, January 1971.
11. Iftach Haitner, Danny Harnik, and Omer Reingold. On the power of the randomized iterate. In CRYPTO '06, pages 22-40, 2006.
12. Piotr Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In FOCS '00), pages 189-197. 2000.
13. Russell Impagliazzo, Noam Nisan, and Avi Wigderson. Pseudorandomness for network algorithms. In STOC '94, pages 356-364, 1994.
14. Eyal Kaplan, Moni Naor, and Omer Reingold. Derandomized constructions of k-wise (almost) independent permutations. In RANDOM '05, number 3624 in Lecture Notes in Computer Science, pages 354 - 365, Berkeley, CA, August 2005. Springer.
15. Shachar Lovett, Omer Reingold, Luca Trevisan, and Salil P. Vadhan. Pseudorandom bit generators that fool modular sums. In APPROX-RANDOM '09, pages 615-630, 2009.
16. Chi-Jen Lu. Improved pseudorandom generators for combinatorial rectangles. Combinatorica, 22:417-434, 2002.
17. J. Matousek. Geometric Discrepancy. Springer, 1999.
18. R. Meka and D. Zuckerman. Small-bias spaces overnite groups. In APPROX-RANDOM '09, 2009.
19. Raghu Meka and David Zuckerman. Pseudorandom generators for polynomial threshold functions. In STOC '10, pages 427-436, 2010.
20. Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
21. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838-856, 1993. (Pubitemid 23677151)
22. Noam Nisan and David Zuckerman. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43-52, 1996.
23. Yuval Rabani and Amir Shpilka. Explicit construction of a small epsilon-net for linear threshold functions. SIAM J. Comput., 39(8):3501-3520, 2010.
24. I. G. Shevtsova. Sharpening of the upper bound of the absolute constant in the berry-esseen inequality. Theory of Probability and its Applications, 51(3):549-553, 2007.
25. D. Sivakumar. Algorithmic derandomization via complexity theory. In STOC '02, pages 619-626, 2002.
26. Thomas Watson. Pseudorandom generators for combinatorial checkerboards. In IEEE Conference on Computational Complexity, 2011. To Appear.