Let N(f) denote the number of zeros of a sparse
multivariate polynomial f(x) over a finite field of
characteristic p. In this lecture, we discuss the
complexity and algorithms for computing the
reduction N(f) modulo a power of p.