
Open access
Date
2014Type
- Conference Paper
ETH Bibliography
yes
Altmetrics
Abstract
Let p be a prime and k, t be positive integers. Given a quadratic equation Q(x1,x2,...,xn)=t mod p^k in n-variables; we present a polynomial time Las-Vegas algorithm that samples a uniformly random solution of the quadratic equation.
Permanent link
https://doi.org/10.3929/ethz-b-000094269Publication status
publishedEditor
Jansen, Klaus
Rolim, José D.P.
Devanur, Nikhil R.
Book title
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)Journal / series
Leibniz International Proceedings in InformaticsVolume
Pages / Article No.
Publisher
Schloss Dagstuhl-Leibniz-Zentrum für InformatikEvent
Subject
Quadratic Forms; Lattices; Modular; p-adicOrganisational unit
03841 - Holenstein, Thomas
More
Show all metadata
ETH Bibliography
yes
Altmetrics