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

@inproceedings{Cheraghchi2009AlmostUniformSO,
  title={Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties},
  author={Mahdi Cheraghchi and A. Shokrollahi},
  booktitle={STACS},
  year={2009}
}
  • Mahdi Cheraghchi, A. Shokrollahi
  • Published in STACS 2009
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    9 Citations

    Topics from this paper

    Algebraic matroids are almost entropic
    • 2
    • PDF
    Sampling and homology via bottlenecks
    • PDF
    Time hierarchies for sampling distributions
    • 8
    • PDF
    Applications of Derandomization Theory in Coding
    • 11
    • PDF
    The Computational Complexity of Randomness
    • PDF
    Non-malleable Codes against Constant Split-State Tampering
    • 81
    Non-Malleability against Polynomial Tampering
    • 1
    • PDF
    General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
    • 14
    • Highly Influenced
    • PDF
    Explicit two-source extractors and more
    • 2
    • PDF

    References

    SHOWING 1-10 OF 22 REFERENCES
    Probabilistic Algorithms in Finite Fields
    • 330
    • PDF
    Counting rational points on curves over finite fields
    • M. Huang, Doug Ierardi
    • Mathematics, Computer Science
    • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
    • 1993
    • 19
    • PDF
    New algorithms for finding irreducible polynomials over finite fields
    • V. Shoup
    • Computer Science, Mathematics
    • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
    • 1988
    • 162
    • PDF
    Deterministic Extractors for Algebraic Sources
    • Zeev Dvir
    • Mathematics, Computer Science
    • Electron. Colloquium Comput. Complex.
    • 2008
    • 1
    Random Generation of Combinatorial Structures from a Uniform Distribution
    • 905
    • PDF
    Numbers of solutions of equations in finite fields
    • 561
    • PDF
    Extractors And Rank Extractors For Polynomial Sources
    • 57
    • PDF