Name
Abstract | ||
|---|---|---|
The flnite fleld Kakeya problem deals with the way lines in difierent direc- tions can overlap in a vector space over a flnite fleld. 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. |
Year | Venue | Keywords |
|---|---|---|
2009 | Electronic Colloquium on Computational Complexity (ECCC) | vector space |
Field | DocType | Volume |
Discrete mathematics,Finite field,Vector space,Combinatorics,Euclidean geometry,Mathematics,Randomness | Journal | 16 |
Citations | PageRank | References |
3 | 0.51 | 20 |
Authors | ||
1 | ||