Skip Navigation

International Mathematics Research Notices (2007) Vol. 2007 : article ID rnm095, 29 pages, doi:10.1093/imrn/rnm095 published on October 16, 2007
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow How to cite this article
Google Scholar
Right arrow Articles by Harvey, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © The Author 2007. Published by Oxford University Press.

Kedlaya's Algorithm in Larger Characteristic

David Harvey

Department of Mathematics, Harvard University, 1 Oxford St, Cambridge MA 02138, USA

Correspondence: Correspondence to be sent to: dmharvey{at}math.harvard.edu

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.