Kedlaya's algorithm in larger characteristic
classification
🧮 math.NT
keywords
algorithmcharacteristickedlayadependencelargerlinearpoint-countingreduced
read the original 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 $p^{1/2}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.