This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 24th Annual IEEE Conference on Computational Complexity
Extractors for Varieties
Paris, France
July 15-July 18
ISBN: 978-0-7695-3717-7
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.
Index Terms:
derandomization, explicit constructions, algebraic geometry
Citation:
Zeev Dvir, "Extractors for Varieties," ccc, pp.102-113, 2009 24th Annual IEEE Conference on Computational Complexity, 2009
Usage of this product signifies your acceptance of the Terms of Use.