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

DOI10.4230/LIPIcs.STACS.2009.1817zbMath1236.68081OpenAlexW1594641388MaRDI QIDQ5389984

Mahdi Cheraghchi, Mohammad Amin Shokrollahi

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_5e47.html

zbMATH Keywords

computational complexityfinite fieldspolynomial functionsalgebraic varietiesrandomized algorithmsuniform sampling

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (3)

Sampling and homology via bottlenecks ⋮ Algebraic matroids are almost entropic ⋮ Non-malleability against polynomial tampering

This page was built for publication: Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties