A quasi-linear time algorithm for computing modular polynomials in dimension 2
MILIO, Enea
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
MILIO, Enea
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Article de revue
This item was published in
LMS Journal of Computation and Mathematics. 2015, vol. 18, p. 603-632
London Mathematical Society
English Abstract
We propose to generalize the work of Régis Dupont for computing modular polynomials in dimension 2 to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and ...Read more >
We propose to generalize the work of Régis Dupont for computing modular polynomials in dimension 2 to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under some heuristics that this algorithm is quasi-linearin its output size. Some properties of the modular polynomials defined from quotients of theta constants are analyzed.We report on experiments with our implementation.Read less <
European Project
Algorithmic Number Theory in Computer Science
Origin
Hal imported