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

Simple item page
dc.creatorCheraghchi, Mahdi
dc.creatorShokrollahi, Amin
dc.date2009-02-07
dc.date.accessioned2026-07-07T12:39:20Z
dc.date.available2026-07-07T12:39:20Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0902.1254
dc.identifierhttp://arxiv.org/abs/0902.1254
dc.identifier26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 277-288
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219072
dc.subjectData Structures and Algorithms
dc.subjectComputational Complexity
dc.titleAlmost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
dc.typetext

Files

Collections

arXiv