Counting solutions to equations in many variables over finite fields
We present a polynomial-time algorithm for computing the zeta function of a smooth projective hypersurface of degree d over a finite field of characteristic p, under the assumption that p is a suitably small odd prime and does not divide d. This improves significantly upon an earlier algorithm of th...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Published: |
2004
|