10.1145/acmotherconferencesACM Other Conferences000000010.5555/0000000Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)APPROX/RANDOM 201410.4230/LIPIcs.APPROX-RANDOM.2014.64344Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime PowerDubeyChandanAuthorHolensteinThomasAuthor04092014643653

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.