Kedlaya's algorithm in larger characteristic
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.