Kedlaya's Algorithm in Larger Characteristic

From MaRDI portal



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.




Cited in
(30)


Describes a project that uses

Uses Software






This page was built for publication: Kedlaya's Algorithm in Larger Characteristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5439938)