Kedlaya's algorithm in larger characteristic

Details Kedlaya's algorithm in larger characteristic Kedlaya's algorithm in larger characteristic

2006-10-31

arxiv.org/abs/math/0610973v2

Mathematics

Number Theory

21 pages; major revision; to appear in International Mathematics Research Notices

Scientific paper

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}$.

Affiliated with

Also associated with

No associations

Rating

Kedlaya's algorithm in larger characteristic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kedlaya's algorithm in larger characteristic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kedlaya's algorithm in larger characteristic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47539