The complexity of distributions

SIAM Journal on Computing

Volumn 41, Issue 1, 2012, Pages 191-218

  Viola, Emanuele ^a  

^a Northeastern University   (United States)

Author keywords

Decision tree; Distribution; Local; Lower bound; Pseudorandom generator; Sampling; Succinct data structure

Indexed keywords

DISTRIBUTION; LOCAL; LOWER BOUNDS; PSEUDORANDOM GENERATORS; SUCCINCT DATA STRUCTURE;

DATA STRUCTURES; SAMPLING; TREES (MATHEMATICS);

DECISION TREES;

EID: 84861643905     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100814998     Document Type: Article

References (51)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
2. A. Ambainis, L. J. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson, The quantum communication complexity of sampling, SIAM J. Comput., 32 (2003), pp. 1570-1585.
3. B. Applebaum, Y. Ishai, and E. Kushilevitz, Cryptography in NC0, SIAM J. Comput., 36 (2006), pp. 845-888.
4. B. Applebaum, Y. Ishai, and E. Kushilevitz, On pseudorandom generators with linear stretch in NC0, Comput. Complex., 17 (2008), pp. 38-69.
5. M. Ajtai and A.Wigderson, Deterministic simulation of probabilistic constant-depth circuits, Adv. Comput. Res., 5 (1989), pp. 199-223.
6. L. Babai, Random oracles separate PSPACE from the polynomial-Time hierarchy, Inform. Process. Lett., 26 (1987), pp. 51-53.
7. R. Beigel, The polynomial method in circuit complexity, in Proceedings of the 8th Structure in Complexity Theory Conference, IEEE, Piscataway, NJ, 1993, pp. 82-95.
8. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput., 13 (1984), pp. 850-864.
9. A. Bogdanov and E. Viola, Pseudorandom bits for polynomials, SIAM J. Comput., 39 (2010), pp. 2464-2486.
10. R. Boppana and J. Lagarias, One-way functions and circuit complexity, Inform. Comput., 74 (1987), pp. 226-240.
11. M. Braverman, Polylogarithmic independence fools AC0 circuits, J. ACM, 57 (2010), Art. 28.
12. H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh, Are bitvectors optimal? SIAM J. Comput., 31 (2002), pp. 1723-1744.
13. B. Chor and O. Goldreich, On the power of two-point based sampling, J. Complexity, 5 (1989), pp. 96-106.
14. B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich, and R. Smolensky, The bit extraction problem and t-resilient functions, in Proceedings of the 26th Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 1985, pp. 396-407.
15. T. Cover and J. Thomas, Elements of Information Theory, 2nd ed., Wiley Ser. Telecom., Wiley-Interscience, Hoboken, NJ, 2006.
16. A. Czumaj, P. Kanarek, M. Kutylowski, and K. Lorys, Delayed path coupling and generating random permutations via distributed stochastic processes, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 1999, pp. 271-280.
17. A. Czumaj, P. Kanarek, M. Kutylowski, and K. Lorys, Switching networks for generating random permutations, in Switching Networks: Recent Adv. Ser. Network Theory Appl. 5, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 25-61.
18. A. De and T. Watson, Extractors and lower bounds for locally samplable sources, in Proceedings of the 15th Workshop on Randomization and Computation (RANDOM), Lecture Notes in Comput. Sci. 6845, Springer, Berlin, 2011, pp. 483-494.
19. I. Diakonikolas, P. Gopalan, R. Jaiswal, R. A. Servedio, and E. Viola, Bounded independence fools halfspaces, SIAM J. Comput., 39 (2010), pp. 3441-3462.
20. Y. Dodis, M. Patrasçu, and M. Thorup, Changing base without losing space, in Proceedings of the 42nd Symposium on the Theory of Computing (STOC), ACM, New York, 2010, pp. 593-602.
21. D. Dubhashi and A. Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms, Cambridge University Press, Cambridge, UK, 2009.
22. B. Dubrov and Y. Ishai, On the randomness complexity of efficient sampling, in Proceedings of the 38th Symposium on Theory of Computing (STOC), ACM, New York, 2006, pp. 711-720.
23. P. Erdos, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc., 51 (1945), pp. 898-902.
24. O. Goldreich, Computational Complexity: A Conceptual Perspective, Cambridge University Press, Cambridge, UK, 2008.
25. O. Goldreich, S. Goldwasser, and A. Nussboim, On the implementation of huge random objects, SIAM J. Comput., 39 (2010), pp. 2761-2822.
26. P. Gopalan, R. O'Donnell, Y. Wu, and D. Zuckerman, Fooling functions of halfspaces under product distributions, in Proceedings of the 25th Conference on Computational Complexity (CCC), IEEE, Piscataway, NJ, 2010, pp. 223-234.
27. V. Guruswami, C. Umans, and S. P. Vadhan, Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes, J. ACM, 56 (2009), Art. 4.
28. D. Gutfreund and E. Viola, Fooling parity tests with parity gates, in Proceedings of the 8th Workshop on Randomization and Computation (RANDOM), Springer, New York, 2004, pp. 381-392.
29. T. Hagerup, Fast parallel generation of random permutations, in Proceedings of the 18th Colloquium on Automata, Languages and Programming (ICALP), Springer, New York, 1991, pp. 405-416.
30. J. Håstad, Computational Limitations of Small-Depth Circuits, MIT Press, Cambridge, UK, 1987.
31. R. Impagliazzo and M. Naor, Efficient cryptographic schemes provably as secure as subset sum, J. Cryptology, 9 (1996), pp. 199-216.
32. J. Littlewood and A. Offord, On the number of real roots of a random algebraic equation. III, Rec. Math. [Mat. Sbornik] N.S., 12 (1943), pp. 277-286.
33. S. Lovett, O. Reingold, L. Trevisan, and S. P. Vadhan, Pseudorandom bit generators that fool modular sums, in Proceedings of the 13th Workshop on Randomization and Computation (RANDOM), Lecture Notes in Comput. Sci. 5687, Springer, New York, 2009, pp. 615-630.
34. S. Lovett and E. Viola, Bounded-depth circuits cannot sample good codes, in Proceedings of the 26th Conference on Computational Complexity (CCC), IEEE, Piscataway, NJ, 2011, pp. 243-251.
35. M. Luby, B. Veličkovíc, and A. Wigderson, Deterministic approximate counting of depth-2 circuits, in Proceedings of the 2nd Israeli Symposium on Theoretical Computer Science (ISTCS), 1993, pp. 18-24.
36. Y. Matias and U. Vishkin, Converting high probability into nearly-constant time-with applications to parallel hashing, in Proceedings of the 23rd Symposium on the Theory of Computing (STOC), ACM, New York, 1991, pp. 307-316.
37. E. Mossel, A. Shpilka, and L. Trevisan, On epsilon-biased generators in NC0, Random Structures Algorithms, 29 (2006), pp. 56-81.
38. N. Nisan, Pseudorandom bits for constant depth circuits, Combinatorica, 11 (1991), pp. 63-70.
39. N. Nisan and A. Wigderson, Hardness vs randomness, J. Comput. Systems Sci., 49 (1994), pp. 149-167.
40. R. Pagh, Low redundancy in static dictionaries with constant query time, SIAM J. Comput., 31 (2001), pp. 353-363.
41. R. Pagh, On the cell probe complexity of membership and perfect hashing, in Proceedings of the 33rd Symposium on the Theory of Computing (STOC), ACM, New York, 2001, pp. 425-432.
42. R. E. A. C. Paley and A. Zygmund, A note on analytic functions in the unit circle, Math. Proc. Cambridge Philos. Soc., 28 (1932), pp. 266-272.
43. M. Patrasçu, Succincter, in Proceedings of the 49th Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 2008, pp. 305-313.
44. M. Patrasçu and E. Viola, Cell-probe lower bounds for succinct partial sums, in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 2010, pp. 117-122.
45. L. Trevisan, A note on approximate counting for k-DNF, in Proceedings of the 7th Workshop on Randomization and Computation (RANDOM), Lecture Notes in Comput. Sci. 3122, Springer, New York, 2004, pp. 417-426.
46. E. Viola, On constructing parallel pseudorandom generators from one-way functions, in Proceedings of the 20th Conference on Computational Complexity (CCC), IEEE, Piscataway, NJ, 2005, pp. 183-197.
47. E. Viola, Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates, SIAM J. Comput., 36 (2007), pp. 1387-1403.
48. E. Viola, Bit-probe lower bounds for succinct data structures, SIAM J. Comput., to appear.
49. E. Viola, The complexity of distributions, in Proceedings of the 51st Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 2010, pp. 202-211.
50. E. Viola, Extractors for circuit sources, in Proceedings of the 52nd Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 2011, pp. 220-229.
51. A. Yao, Theory and applications of trapdoor functions, in Proceedings of the 23rd Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 1982, pp. 80-91.