Kedlaya's Algorithm in Larger Characteristic

By David Harvey. 2006

67 citations recorded by the source corpus.

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}$.

Subfields: Computational Theory and Mathematics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/b425a0c145347aa6fdcff4fb06cc30f739a89d46

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. David Harvey
2. Kim Laine
3. Hao Chen
4. Rachel Player
5. Michael Naehrig
6. Patrick Longa

In Mathematical Physics

1. David Harvey

Citations in the corpus

• Counting points on hyperelliptic curves in average polynomial time (2012, methodology): “Our starting point for the new algorithm is the author’s modification of Kedlaya’s algorithm [Har07].”