Extractors for circuit sources

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

Volumn , Issue , 2011, Pages 220-229

  Viola, Emanuele ^a  

^a Northeastern University   (United States)

Author keywords

circuit source; extractor; local; sampling; the complexity of distributions small depth circuit; weak randomness source

Indexed keywords

CIRCUIT LOWER BOUNDS; CONVEX COMBINATIONS; DETERMINISTIC EXTRACTOR; EXTRACTOR; LOCAL; LOWER BOUNDS; MIN-ENTROPY; WEAK RANDOMNESS;

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; SAMPLING;

ENTROPY;

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

References (44)

1. 1 [1]-formulae on finite structures," Ann. Pure Appl. Logic, vol. 24, no. 1, pp. 1-48, 1983.
2. N. Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth, "Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs." IEEE Transactions on Information Theory, vol. 38, no. 2, pp. 509-516, 1992.
3. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson, "Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors," J. ACM, vol. 57, no. 4, 2010.
4. P. Beame, "A switching lemma primer," Department of Computer Science and Engineering, University of Washington, Tech. Rep. UW-CSE-95-07-01, November 1994, available from http://www.cs.washington.edu/homes/beame/.
5. M. Ben-Or and N. Linial, "Collective coin-flipping," in Randomness and Computation, S. Micali, Ed. New York: Academic Press, 1990, pp. 91-115.
6. E. Ben-Sasson and S. Kopparty, "Affine dispersers from subspace polynomials," in Symposium on the Theory of Computing (STOC), 2009, pp. 65-74.
7. M. Blum, "Independent unbiased coin flips from a correlated biased source - a finite state Markov chain," Combinatorica, vol. 6, no. 2, pp. 97-108, 1986.
8. J. Bourgain, "On the construction of affine extractors," Geometric And Functional Analysis, vol. 17, pp. 33-57, 2007.
9. B. Chor and O. Goldreich, "Unbiased bits from sources of weak randomness and probabilistic communication complexity," SIAM J. on Computing, vol. 17, no. 2, pp. 230-261, Apr. 1988.
10. B. Chor, O. Goldreich, J. H° astad, J. Friedman, S. Rudich, and R. Smolensky, "The bit extraction problem and t-resilient functions," in 26th IEEE Symposium on Foundations of Computer Science (FOCS), 1985, pp. 396-407.
11. A. De and T. Watson, "Extractors and lower bounds for locally samplable sources," in Workshop on Randomization and Computation (RANDOM), 2011.
12. I. Diakonikolas, P. Gopalan, R. Jaiswal, R. A. Servedio, and E. Viola, "Bounded independence fools halfspaces," SIAM J. on Computing, vol. 39, no. 8, pp. 3441-3462, 2010.
13. J. Edmonds, R. Impagliazzo, S. Rudich, and J. Sgall, "Communication complexity towards lower bounds on circuit depth," Computational Complexity, vol. 10, no. 3, pp. 210-246, 2001. (Pubitemid 33582933)
14. 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.
15. A. Gabizon, R. Raz, and R. Shaltiel, "Deterministic extractors for bit-fixing sources by obtaining an independent seed," SIAM J. Comput., vol. 36, no. 4, pp. 1072-1094, 2006. (Pubitemid 47246877)
16. V. Guruswami, C. Umans, and S. P. Vadhan, "Unbalanced expanders and randomness extractors from parvaresh-vardy codes," J. ACM, vol. 56, no. 4, 2009.
17. L. H. Harper, "Optimal assignments of numbers to vertices," SIAM Journal on Applied Mathematics, vol. 12, no. 1, pp. 131-135, 1964.
18. S. Hart, "A note on the edges of the n-cube," Discrete Mathematics, vol. 14, no. 2, pp. 157-163, 1976.
19. J. H° astad, Computational limitations of small-depth circuits. MIT Press, 1987.
20. R. Impagliazzo and V. Kabanets, "Constructive proofs of concentration bounds," in Workshop on Randomization and Computation (RANDOM). Springer, 2010, pp. 617-631.
21. R. Impagliazzo and M. Naor, "Efficient cryptographic schemes provably as secure as subset sum," Journal of Cryptology, vol. 9, no. 4, pp. 199-216, 1996. (Pubitemid 126814359)
22. J. Kahn, G. Kalai, and N. Linial, "The influence of variables on Boolean functions," in 29th Symposium on Foundations of Computer Science (FOCS), 1988, pp. 68-80.
23. J. Kamp, A. Rao, S. P. Vadhan, and D. Zuckerman, "Deterministic extractors for small-space sources," J. Comput. Syst. Sci., vol. 77, no. 1, pp. 191-220, 2011.
24. J. Kamp and D. Zuckerman, "Deterministic extractors for bitfixing sources and exposure-resilient cryptography," SIAM J. Comput., vol. 36, no. 5, pp. 1231-1247, 2007. (Pubitemid 47632444)
25. H. K. Lee, "Decision trees and influence: an inductive proof of the osss inequality," Theory of Computing, vol. 6, no. 1, pp. 81-84, 2010.
26. X. Li, "Improved constructions of three source extractors," in Conference on Computational Complexity (CCC), 2011.
27. -, "A new approach to affine extractors and dispersers," in Conference on Computational Complexity (CCC), 2011.
28. S. Lovett and E. Viola, "Bounded-depth circuits cannot sample good codes," in Conference on Computational Complexity (CCC), 2011, invited and submitted to special issue of Computational Complexity.
29. R. O'Donnell, M. E. Saks, O. Schramm, and R. A. Servedio, "Every decision tree has an influential variable," in Symposium on Foundations of Computer Science (FOCS). IEEE, 2005, pp. 31-39.
30. A. Panconesi and A. Srinivasan, "Randomized distributed edge coloring via an extension of the chernoff-hoeffding bounds," SIAM J. Comput., vol. 26, no. 2, pp. 350-368, 1997. (Pubitemid 127652069)
31. A. Rao, "Extractors for low-weight affine sources," in Conference on Computational Complexity (CCC). IEEE, 2009, pp. 95-101.
32. R. Raz, "A parallel repetition theorem," SIAM J. Comput., vol. 27, no. 3, pp. 763-803, 1998.
33. R. Raz, O. Reingold, and S. P. Vadhan, "Extracting all the randomness and reducing the error in Trevisan's extractors," J. Comput. Syst. Sci., vol. 65, no. 1, pp. 97-128, 2002. (Pubitemid 41161760)
34. M. Santha and U. V. Vazirani, "Generating quasi-random sequences from semi-random sources," vol. 33, no. 1, pp. 75-87, Aug. 1986.
35. R. Shaltiel, "Dispersers for affine sources with subpolynomial entropy," in Symposium on Foundations of Computer Science (FOCS). IEEE, 2011.
36. R. Shaltiel and E. Viola, "Hardness amplification proofs require majority," SIAM J. on Computing, vol. 39, no. 7, pp. 3122-3154, 2010.
37. N. Thapen, "Notes on switching lemmas," 2009, http://www.math.cas.cz/~thapen/.
38. L. Trevisan, "Extractors and pseudorandom generators," Journal of the ACM, vol. 48, no. 4, pp. 860-879, 2001.
39. L. Trevisan and S. Vadhan, "Extracting randomness from samplable distributions," in Symposium on Foundations of Computer Science (FOCS), 2000, pp. 32-42.
40. E. Viola, "On constructing parallel pseudorandom generators from one-way functions," in 20th Conference on Computational Complexity (CCC). IEEE, 2005, pp. 183-197.
41. -, "The complexity of distributions," in 51th Symposium on Foundations of Computer Science (FOCS). IEEE, 2010, pp. 202-211, to appear in SIAM J. on Computing.
42. J. von Neumann, "Various techniques used in connection with random digits," National Bureau of Standards, Applied Mathematics Series, vol. 12, pp. 36-38, 1951.
43. A. Yao, "Separating the polynomial-time hierarchy by oracles," in 26th Symposium on Foundations of Computer Science (FOCS). IEEE, 1985, pp. 1-10.
44. A. Yehudayoff, "Affine extractors over prime fields," 2010, unpublished manuscript.