Kedlaya's algorithm in larger characteristic

Simple item page
dc.creatorHarvey, David
dc.date2006-10-31
dc.date2007-08-23
dc.date.accessioned2026-07-07T08:25:05Z
dc.date.available2026-07-07T08:25:05Z
dc.descriptionWe 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}$.
dc.description21 pages; major revision; to appear in International Mathematics Research Notices
dc.identifierhttps://arxiv.org/abs/math/0610973
dc.identifierhttp://arxiv.org/abs/math/0610973
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136553
dc.subjectNumber Theory
dc.subject11G20; 11-04
dc.titleKedlaya's algorithm in larger characteristic
dc.typetext

Files

Collections

arXiv