Counting points on varieties over finite fields of small characteristic
| dc.creator | Lauder, Alan G. B. | |
| dc.creator | Wan, Daqing | |
| dc.date | 2006-12-06 | |
| dc.date.accessioned | 2026-07-07T07:34:41Z | |
| dc.date.available | 2026-07-07T07:34:41Z | |
| dc.description | We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing the order of the group of rational points on the Jacobian of a smooth geometrically connected projective curve over a finite field of small characteristic. | |
| dc.description | To appear in: "Algorithmic number theory: lattices, number fields, curves and cryptography", J.P. Buhler and P. Stevenhagen (ed.), Math. Sci. Res. Inst. Publ. 44. (Submitted July 2001; Accepted October 2002.) | |
| dc.identifier | https://arxiv.org/abs/math/0612147 | |
| dc.identifier | http://arxiv.org/abs/math/0612147 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/119851 | |
| dc.subject | Number Theory | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 11Y16, 11T99, 14Q15 | |
| dc.title | Counting points on varieties over finite fields of small characteristic | |
| dc.type | text |