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

Abstract : 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.
Type de document :
Communication dans un congrès
Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.277-288, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00359299
Contributeur : Publications Loria <>
Soumis le : vendredi 6 février 2009 - 15:06:41
Dernière modification le : lundi 2 octobre 2017 - 16:06:04
Document(s) archivé(s) le : mardi 8 juin 2010 - 22:00:40

Fichiers

cheraghchi_new.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00359299, version 1
  • ARXIV : 0902.1254

Collections

Citation

Mahdi Cheraghchi, Amin Shokrollahi. Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.277-288, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00359299〉

Partager

Métriques

Consultations de la notice

50

Téléchargements de fichiers

70