Some deterministic and probabilistic methods are presented for countin
g and estimating the number of points on curves over finite fields, an
d on their projections. The classical question of estimating the size
of the image of a univariate polynomial is a special case. For curves
given by sparse polynomials, the counting problem is #P-comDlete via p
robabilistic parsimonious Turing reductions.