Extractors and lower bounds for locally samplable sources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6845 LNCS, Issue , 2011, Pages 483-494

  De, Anindya ^a   Watson, Thomas ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

extractors; locally samplable sources; lower bounds

Indexed keywords

DETERMINISTIC EXTRACTOR; EXTRACTORS; IMPROVE-A; INPUT-OUTPUT; LOCALLY SAMPLABLE SOURCES; LOWER BOUNDS; MIN-ENTROPY; RANDOM BITS; RANDOM INPUT; STATISTICAL DISTANCE;

BOOLEAN FUNCTIONS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 80052377551     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22935-0_41     Document Type: Conference Paper

References (28)

1. Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. SIAM Journal on Computing 36(4), 1095-1118 (2006)
2. Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., Wigderson, A.: Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. Journal of the ACM 57(4) (2010)
3. Barak, B., Rao, A., Shaltiel, R., Wigderson, A.: 2-source dispersers for subpolynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 671- 680 (2006)
4. Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory 1, 1-32 (2005)
5. Bourgain, J.: On the construction of affine-source extractors. Geometric and Functional Analysis 1, 33-57 (2007)
6. Chor, B., Friedman, J., Goldreich, O., Håstad, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient functions. In: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp. 396-407 (1985)
7. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing 17(2), 230-261 (1988)
8. DeVos, M., Gabizon, A.: Simple affine extractors using dimension expansion. In: Proceedings of the 25th IEEE Conference on Computational Complexity, pp. 50-57 (2010)
9. Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 334-344. Springer, Heidelberg (2004)
10. Dvir, Z.: Extractors for varieties. In: Proceedings of the 24th IEEE Conference on Computational Complexity, pp. 102-113 (2009)
11. Dvir, Z., Gabizon, A., Wigderson, A.: Extractors and rank extractors for polynomial sources. Computational Complexity 18(1), 1-58 (2009)
12. Gabizon, A., Raz, R.: Deterministic extractors for affine sources over large fields. Combinatorica 28(4), 415-440 (2008)
13. Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM Journal on Computing 36(4), 1072-1094 (2006)
14. Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Journal of the ACM 56(4) (2009)
15. Håstad., J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the 18th ACM Symposium on Theory of Computing, pp. 6-20 (1986)
16. Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for smallspace sources. Journal of Computer and System Sciences 77(1), 191-220 (2011)
17. Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing 36(5), 1231-1247 (2007)
18. Li, X.: Improved constructions of three source extractors. In: Proceedings of the 26th IEEE Conference on Computational Complexity, pp. 126-136 (2011)
19. Li, X.: A new approach to affine extractors and dispersers. In: Proceedings of the 26th IEEE Conference on Computational Complexity, pp. 137-147 (2011)
20. Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 52(1), 43-52 (1996)
21. Rao, A.: Extractors for a constant number of polynomially small min-entropy independent sources. SIAM Journal on Computing 39(1), 168-194 (2009)
22. Rao, A.: Extractors for low-weight affine sources. In: Proceedings of the 24th IEEE Conference on Computational Complexity, pp. 95-101 (2009)
23. Raz, R.: Extractors with weak random seeds. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 11-20 (2005)
24. Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 32-42 (2000)
25. Vadhan, S.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology 17(1), 43-77 (2004)
26. Viola, E.: The complexity of distributions. In: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, pp. 202-211 (2010)
27. Viola, E.: Extractors for circuit sources. Technical Report TR11-056, Electronic Colloquium on Computational Complexity (2011)
28. Yehudayoff, A.: Affine extractors over prime fields (2010) (manuscript)