We consider the problem of recovering an unknown sparse multivariate polynomial
over a finite field
of prime order
from approximate values of
) at polynomially many points
selected uniformly at random. Our result is based on a combination of bounds on exponential sums with the lattice reduction technique.