Name
Abstract | ||
|---|---|---|
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a function (an extractor) whose output is close to uniform even if the input is drawn uniformly from the set of solutions of an unknown system of low degree polynomials. This problem generalizes the problem of extraction from affine sources which has drawn a considerable amount of interest lately. We present two constructions of explicit extractors for varieties. The first works for varieties of any size (including one dimensional varieties, or curves) and requires field size which is exponential in the overall dimension of the space. Our second extractor allows the field size to be polynomial in the degree of the equations defining the variety, but works only for varieties whose size is at least the square root of the total size of the space. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/CCC.2009.7 | IEEE Conference on Computational Complexity |
Keywords | Field | DocType |
algebraic geometry,polynomials,cryptography,algebra,turing machines,computational complexity,data mining,sampling methods,algebraic variety,construction industry,geometry,random variables,entropy | Affine transformation,Discrete mathematics,Random variable,Algebraic geometry,Polynomial,Algebraic variety,Square root,Mathematics,Randomness,Computational complexity theory | Journal |
Volume | Issue | ISSN |
21 | 4 | 1093-0159 |
Citations | PageRank | References |
7 | 0.45 | 16 |
Authors | ||
1 | ||