Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time, II
David Harvey, Andrew V. Sutherland
TL;DR
This paper introduces an improved, faster algorithm for computing the Hasse-Witt matrices of hyperelliptic curves over Q at all primes of good reduction up to a specified bound, enhancing previous methods.
Contribution
The authors develop a simpler and more efficient algorithm for computing Hasse-Witt matrices across multiple primes, improving computational speed and simplicity.
Findings
Algorithm computes matrices for all primes up to N
Significantly faster than previous methods
Simpler implementation and theoretical framework
Abstract
We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.