Kedlaya's algorithm in larger characteristic

Int Math Res Notices 2007 (2007), no. rnm095, rnm095–29 (DOI).

arXiv preprint (August 2007).

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 p1/2.


Back to the main page