2-Source dispersers for n°(1) entropy, and ramsey graphs beating the frankl-wilson construction

Annals of Mathematics

Volumn 176, Issue 3, 2012, Pages 1483-1544

  Barak, Boaz ^a   Rao, Anup ^b   Shaltiel, Ronen ^c   Wigderson, Avi ^d  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF WASHINGTON   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

^d INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84872472857     PISSN: 0003486X     EISSN: None     Source Type: Journal    
DOI: 10.4007/annals.2012.176.3.3     Document Type: Article

References (27)

1. N. Alon, The Shannon capacity of a union, Combinatorica 18 (1998), 301-310. MR 1721946. Zbl 0921.05039. http://dx.doi.org/10.1007/PL00009824.
2. õ(log n)-Ramsey graph, 2006, Tech. report. arXiv math.CO/0601651.
3. B. Barak, R. Impagliazzo, and A. Wigderson, Extracting randomness using few independent sources, SIAM J. Comput. 36 (2006), 1095- 1118, preliminary version in FOCS 2004. MR 2272272. Zbl 1127.68030. http://dx.doi.org/10.1137/S0097539705447141.
4. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson, Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors, J. ACM 57 (2010), 52pp, preliminary version in STOC 2005. MR 2677118. Zbl 1192.68468. http: //dx.doi.org/10.1145/1734213.1734214.
5. J. Bourgain, More on the sum-product phenomenon in prime fields and its applications, Int. J. Number Theory 1 (2005), 1-32. MR 2172328. Zbl 1173.11310. http://dx.doi.org/10.1142/S1793042105000108.
6. J. Bourgain, N. Katz, and T. Tao, A sum-product estimate in finite fields, and applications, Geom. Funct. Anal. 14 (2004), 27-57. MR 2053599. Zbl 1145.11306. http://dx.doi.org/10.1007/s00039-004-0451-1.
7. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, Randomness conductors and constant-degree lossless expanders, in Proceed- ings of the Thirty-Fourth Annual ACM Symposium on Theory of Comput- ing, ACM, New York, 2002, pp. 659-668. MR 2121193. Zbl 1192.68475. http://dx.doi.org/10.1145/509907.510003.
8. B. Chor and O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput. 17 (1988), 230-261. MR 0935339. Zbl 0644.94008. http://dx.doi.org/10.1109/SFCS.1985.62.
9. K.-M. Chung and S. Vadhan, personal communication.
10. P. Frankl and R. M. Wilson, Intersection theorems with geometric consequences, Combinatorica 1 (1981), 357-368. MR 0647986. Zbl 0498. 05048. http://dx.doi.org/10.1007/BF02579457.
11. P. Gopalan, Constructing Ramsey graphs from boolean function representations, in Proceedings of the 21st Annual IEEE Conference on Com- putational Complexity (CCC'06), 2006. http://dx.doi.org/10.1109/CCC.2006.14.
12. V. Grolmusz, Low rank co-diagonal matrices and Ramsey graphs, Elec- tron. J. Combin. 7 (2000), Research Paper 15, 7 pp. MR 1756284. Zbl 0939.05060. Available at http://www.combinatorics.org/ojs/index.php/eljc/article/view/v7i1r15.
13. V. Guruswami, Better extractors for better codes?, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, ACM, New York, 2004, pp. 436-444. MR 2121629. Zbl 1192.68363. http://dx.doi.org/10.1145/1007352.1007422.
14. C.-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson, Extractors: optimal up to constant factors, in Proceedings of the Thirty-Fifth An- nual ACM Symposium on Theory of Computing, ACM, New York, 2003, pp. 602-611. MR 2120441. Zbl 1192.68859. http://dx.doi.org/10.1145/780542.780630.
15. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson, On data structures and asymmetric communication complexity, J. Comput. System Sci. 57 (1998), 37-49. MR 1649806. Zbl 0920.68042. http://dx.doi.org/10.1006/jcss.1998.1577.
16. P. Pudlák and V. Rödl, Pseudorandom sets and explicit constructions of Ramsey graphs, in Complexity of Computations and Proofs, Quad. Mat. 13, Dept. Math., Seconda Univ. Napoli, Caserta, 2004, pp. 327-346. MR 2131412. Zbl 1074.05088.
17. F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. S2-30 (1930), 264-286. MR 1576401. JFM 55.0032.04. http://dx.doi.org/10.1112/plms/s2-30.1.264.
18. A. Rao, Extractors for a constant number of polynomially small minentropy independent sources, SIAM J. Comput. 39 (2009), 168-194, preliminary version in STOC 2006. http://dx.doi.org/10.1137/060671218.
19. R. Raz, Extractors with weak random seeds, in STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, ACM, New York, 2005, pp. 11-20. MR 2181597. Zbl 1192.68373. http://dx.doi.org/10.1145/1060590.1060593.
20. R. Raz, O. Reingold, and S. Vadhan, Extracting all the randomness and reducing the error in Trevisan's extractors, J. Comput. System Sci. 65 (2002), 97-128. MR 1946290. Zbl 1020.68029. http://dx.doi.org/10.1006/jcss.2002.1824.
21. O. Reingold, R. Shaltiel, and A. Wigderson, Extracting randomness via repeated condensing, in 41st Annual Symposium on Founda- tions of Computer Science (Redondo Beach, CA, 2000), IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, pp. 22-31. MR 1931801. http://dx.doi.org/10.1109/SFCS.2000.892008.
22. M. Sántha and U. V. Vazirani, Generating quasi-random sequences from semi-random sources, J. Comput. System Sci. 33 (1986), 75-87. MR 0864080. Zbl 0612.94004. http://dx.doi.org/10.1016/0022-0000(86)90044-9.
23. R. Shaltiel, Recent developments in explicit constructions of extractors, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS (2002), 67-95. MR 1920329. Zbl 1051.68070.
24. A. Ta-Shma and D. Zuckerman, Extractor codes, IEEE Trans. Inform. Theory 50 (2004), 3015-3025. MR 2103480. http://dx.doi.org/10.1109/TIT.2004.838377.
25. L. Trevisan, Extractors and pseudorandom generators, J. ACM 48 (2001), 860-879. MR 2144932. Zbl 1127.68403. http://dx.doi.org/10.1145/502090.502099.
26. U. Vazirani, Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightlyrandom sources (extended abstract), in Proceedings of the 17th An- nual ACM Symposium on Theory of Computing, 1985, pp. 366-378. http://dx.doi.org/10.1145/22145.22186.
27. A. Wigderson and D. Zuckerman, Expanders that beat the eigenvalue bound: explicit construction and applications, Combinatorica 19 (1999), 125-138. MR 1722214. Zbl 0929.05075. http://dx.doi.org/10.1007/s004930050049.