Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR09-077 | 16th September 2009 20:32

From Randomness Extraction to Rotating Needles

RSS-Feed




TR09-077
Authors: Zeev Dvir
Publication: 19th September 2009 12:37
Downloads: 4242
Keywords: 


Abstract:

The finite field Kakeya problem deals with the way lines in different directions can overlap in a vector space over a finite field. This problem came up in the study of certain Euclidean problems and, independently, in the search for explicit randomness extractors. We survey recent progress on this problem and describe several of its applications.



ISSN 1433-8092 | Imprint