Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common zero of the polynomials almost uniformly at random. The statistical distance between the output distribution of the algorithm and the uniform distribution on the set of common zeros is polynomially small in the field size, and the running time of the algorithm is polynomial in the description of the polynomials and their degrees provided that the number of the polynomials is a constant.


Published in:
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS)
Presented at:
26th International Symposium on Theoretical Aspects of Computer Science (STACS), Freibourg, Germany, February 2009
Year:
2009
Keywords:
Laboratories:


Note: The status of this file is: EPFL only


 Record created 2009-09-30, last modified 2018-09-13

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)