Computing modular polynomials in quasi-linear time

Andreas Enge

Resumen

No disponible

PÁGINAS

pp. 1809 - 1824

NÚMERO

Volumen: 78 Número: 267 Parte: 0 (2009)

MATERIAS

REVISTAS SIMILARES

Artículos similares

Scalable and Modular Algorithms for Floating-Point Matrix Multiplication on Reconfigurable Computing Systems

Acceso

Ling Zhuo; Prasanna, V.K. Pág. 433 - 448

Revista: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

Computing weight $2$ modular forms of level $p^2$

Acceso

Ariel Pacetti; Fernando Rodriguez Villegas; with an appendix by B. Gross Pág. 1545 - 1557

Revista: MATHEMATICS OF COMPUTATION

Computing isogeny covariant differential modular forms

Acceso

Chris Hurlburt Pág. 905 - 926

Revista: MATHEMATICS OF COMPUTATION

Ver todas las revistas