MILIO, Enea

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

MILIO, Enea
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]

Idioma

Article de revue

Este ítem está publicado en

LMS Journal of Computation and Mathematics. 2015, vol. 18, p. 603-632

London Mathematical Society

Resumen en inglés

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.< Leer menos

URI

https://oskar-bordeaux.fr/handle/20.500.12278/194356

Proyecto europeo

Algorithmic Number Theory in Computer Science

Orígen

Importado de Hal

Centros de investigación

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251