- Abstract:
- 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 the author and Wan which is only polynomial-time when the dimension is fixed.
- Publication status:
- Published
- Journal:
- Foundations of Computational Mathematics
- Volume:
- 4
- Issue:
- 3
- Pages:
- 221-267
- Publication date:
- 2004-08-01
- DOI:
- EISSN:
-
1615-3383
- ISSN:
-
1615-3375
- URN:
-
uuid:d9ebcd3e-d700-49ad-86ca-e4a1a1bdaf1d
- Source identifiers:
-
29864
- Local pid:
- pubs:29864
- Copyright date:
- 2004
Journal article
Counting solutions to equations in many variables over finite fields
Actions
Authors
Bibliographic Details
Terms of use
Metrics
Altmetrics
Dimensions
If you are the owner of this record, you can report an update to it here: Report update to this record