Kedlaya's algorithm in larger characteristic

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Number Theory, 11G20; 11-04

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/136553

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0610973
 http://arxiv.org/abs/math/0610973

Collections

arXiv