|Bill Allombert on Mon, 16 Feb 2015 14:02:00 +0100|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Re: hyperellcharpoly for y^2=x^(2*g+2)+...|
On Mon, Feb 16, 2015 at 01:21:09PM +0100, Jean-Pierre Flori wrote: > Great news! > What did you implement exactly? I implemented the ideas in the paper of Mike Harrison: Harrison, M. An extension of Kedlaya's algorithm for hyperelliptic curves. Journal of Symbolic Computation, 47 (1) (2012), 89-101. http://arxiv.org/pdf/1006.4206v3.pdf (for which I am very grateful). I did not implement the trick of using x^i*dx/y^3 because I did not understand how to do it. If you like to work on it, be my guest! Also I am working on an implementation of the naive p^2 algorithm for genus 2 curves over F_p, which is faster than my implementation of Kedlaya algorithm for small p (says p<5000). The goal is to compute L series of genus 2 curves using Pascal Molin method. Cheers, Bill.