Kedlaya's algorithm in larger characteristic

Abstract

We show that the linear dependence on $p$ of the running time of Kedlaya's point-counting algorithm in characteristic $p$ may be reduced to $p^{1/2}$.

21 pages; major revision; to appear in International Mathematics Research Notices

References in corpus (1)

• Counting Points on Hyperelliptic Curves using Monsky-Washnitzer Cohomology

Cited by in corpus (1)

• Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time