Extensions to the method of multiplicities, with applications to Kakeya sets and mergers

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

Volumn , Issue , 2009, Pages 181-190

  Dvir, Zeev ^a   Kopparty, Swastik ^b   Saraf, Shubhangi ^b   Sudan, Madhu ^c  

^a IAS ^*  (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Extractors; Polynomial method; Randomness

Indexed keywords

COMBINATORICS; EXPONENTIAL FACTORS; FINITE FIELDS; FINITE SUBSETS; HIGH MULTIPLICITY; INPUT VARIABLES; INTERPOLATING POLYNOMIALS; LOW DEGREE; MIN-ENTROPY; POLYNOMIAL METHODS; RANDOM POINTS; RANDOM SEEDS; RANDOMNESS EXTRACTORS;

COMPUTER SCIENCE; ENTROPY; FIBER OPTIC CHEMICAL SENSORS; INTERPOLATION; MERGERS AND ACQUISITIONS; POLYNOMIALS; RANDOM PROCESSES; SEED; SET THEORY; VECTOR SPACES;

RANDOM VARIABLES;

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

References (22)

1. Yuval Cassuto and Jehoshua Bruck. A combinatorial bound on the list size. Paradise Laboratory Technical report, California Institute of Technology, 2004.
2. Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan. Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. ECCC Technical report TR09-004, Revision 02, May 2009.
3. Z. Dvir and A. Shpilka. An improved analysis of linear mergers. Comput. Complex., 16(1):34-59, 2007. (Extended abstract appeared in RANDOM 2005).
4. Z. Dvir. On the size of Kakeya sets in finite fields. J. AMS (to appear), 2008.
5. Zeev Dvir and Avi Wigderson. Kakeya sets, new mergers and old extractors. In FOCS, pages 625-633. IEEE Computer Society, 2008.
6. Venkatesan Guruswami and Atri Rudra. Explicit capacity-achieving list-decodable codes. In Jon M. Kleinberg, editor, STOC, pages 1-10. ACM, 2006.
7. Venkatesan Guruswami and Madhu Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45:1757-1767, 1999.
8. Venkatesan Guruswami, Christopher Umans, and Salil P. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In IEEE Conference on Computational Complexity, pages 96-108. IEEE Computer Society, 2007.
9. J. W. P. Hirschfeld, G. Korchmaros, and F. Torres. Algebraic Curves over a Finite Field (Princeton Series in Applied Mathematics). Princeton University Press, 2008.
10. Chi-Jen Lu, Omer Reingold, Salil Vadhan, and Avi Wigderson. Extractors: Optimal up to constant factors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing", 2003.
11. Farzad Parvaresh and Alexander Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In FOCS, pages 285-294. IEEE Computer Society, 2005.
12. Ran Raz, Omer Reingold, and Salil Vadhan. Extracting all the Randomness and Reducing the Error in Tre-visan's Extractors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing", 1999.
13. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
14. Ronen Shaltiel. Recent developments in extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67-95, 2002.
15. Shubhangi Saraf and Madhu Sudan. Improved lower bound on the size of Kakeya sets over finite fields. Analysis and PDE (to appear), 2008.
16. Madhu Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.
17. A. Ta-Shma. On extracting randomness from weak random sources. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, pages 276-285, 1996.
18. A. Ta-Shma. Refining Randomness. PhD Thesis, The Hebrew University, Jerusalem, Israel, 1996.
19. K. Thas. Personal Communication, March 2009.
20. Avi Wigderson and David Zuckerman. Expanders that beat the eigenvalue bound: explicit construction and applications. Combinatorica, 19(1):125-138, 1999.
21. T. Wolff. Recent work connected with the Kakeya problem. In Prospects in Mathematics, pages 129-162. Princeton, NJ, 1999.
22. David Zuckerman. Linear degree extractors and the in-approximability of max clique and chromatic number. Theory of Computing, 3(1):103-128, 2007.