From affine to two-source extractors via approximate duality

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 177-186

  Ben Sasson, Eli ^a   Zewi, Noga ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

affine sources; approximate duality; discrepancy; dispersers; extractors; independent sources; polynomial Freiman Ruzsa conjecture; Ramsey graphs

Indexed keywords

ADDITIVES; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; ERRORS; SIGNAL THEORY;

APPROXIMATE DUALITY; DISCREPANCY; DISPERSERS; EXTRACTORS; INDEPENDENT SOURCES; RAMSEY GRAPHS;

ENTROPY;

EID: 79959733663     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993661     Document Type: Conference Paper

References (25)

1. B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness using few independent sources. SIAM Journal on Computing, 36(4):1095-1118, 2006. Preliminary version in FOCS' 04. (Pubitemid 47246878)
2. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In Proc. 37th STOC. ACM, 2005.
3. B. Barak, A. Rao, R. Shaltiel, and A. Wigderson. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. In Proc. 38th Symposium on Theory of Computing (STOC), pages 671-680. ACM, 2006.
4. E. Ben-Sasson, S. Hoory, E. Rozenman, S. Vadhan, and A. Wigderson. Extractors for affine sources, unpublished manuscript. 2001.
5. E. Ben-Sasson and S. Kopparty. Affine dispersers from subspace polynomials. In M. Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pages 65-74. ACM, 2009.
6. J. Bourgain. More on the sum-product phenomenon in prime fields and its application. International Journal of Number Theory, 1:1-32, 2005.
7. J. Bourgain. On the construction of affine extractors. Geometric and Functional Analysis, 17(1):33-57, 2007.
8. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, 1988.
9. M. DeVos and A. Gabizon. Simple affine extractors using dimension expansion. Electronic Colloquium on Computational Complexity (ECCC), (63), 2009.
10. P. Erdös. Some remarks on the theory of graphs. B.A.M.S., 53:292-294, 1947.
11. G. A. Freiman. Foundations of a structural theory of set addition, volume 37. American Mathematical Society, 1973.
12. A. Gabizon and R. Raz. Deterministic extractors for affine sources over large fields. Combinatorica, 28(4):415-440, 2008.
13. B. Green. Finite field models in additive combinatorics. In B. S. Webb, editor, Surveys in Combinatorics, number 327 in London Mathematical Society Lecture Note Series, pages 1-27. Cambridge University press, 2005.
14. B. Green. Finite field models in additive combinatorics. In London Mathematical Society Lecture Note Series, volume 324. Cambridge University Press, 2005.
15. B. Green and T. Tao. A note on the Freiman and Balog-Szemerédi- Gowers theorems in nite fields. Journal of the Australian Mathematical Society, 86(01):61-74, 2009.
16. X. Li. A new approach to affine extractors and dispersers. Electronic Colloquium on Computational Complexity (ECCC), (064), 2010.
17. P. Pudlák and V. Rödl. Pseudorandom sets and explicit constructions of Ramsey graphs. Quaderni di Matematica, Dipartimanto di Matematica, Seconda Universita di Napoli, Caserta, 13:327-346, 2004.
18. A. Rao. An exposition of bourgain's 2-source extractor. In ECCCTR: Electronic Colloquium on Computational Complexity, technical reports, 2007.
19. R. Raz. Extractors with weak random seeds. In STOC: ACM Symposium on Theory of Computing (STOC), 2005.
20. I. Z. Ruzsa. An analog of Freiman's theorem in groups. Astèrique, 258:323-326, 1999.
21. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77:67-95, 2002.
22. T. Tau and V. Vu. Additive Combinatorics. Cambridge University Press, Cambridge, 2006.
23. Y. Tauman Kalai, X. Li, and A. Rao. 2-source extractors under computational assumptions and cryptography with defective randomness. In Proc. 50th Foundations of Computer Science (FOCS). IEEE, 2009.
24. A. Yehudayo. Affine extractors over prime fields. 2009.
25. D. I. Zuckerman. Computing efficiently using general weak random sources. PhD thesis, University of California, Berkeley, 1991.