English

Kedlaya's algorithm in larger characteristic

Number Theory 2007-08-23 v2

Abstract

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

Cite

@article{arxiv.math/0610973,
  title  = {Kedlaya's algorithm in larger characteristic},
  author = {David Harvey},
  journal= {arXiv preprint arXiv:math/0610973},
  year   = {2007}
}

Comments

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

R2 v1 2026-07-22T17:45:24.573Z