We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius. For fixed p, the asymptotic running time for a curve of genus g over the field of p^n elements is O(g4+ε n3+ε).
No takes yet. Share an insight, caveat, or question.
Kiran S. Kedlaya (2001) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: