The complexity of class polynomial computation via floating point approximations
From MaRDI portal
Publication:3055132
DOI10.1090/S0025-5718-08-02200-XzbMath1208.11136MaRDI QIDQ3055132
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
elliptic curves; modular functions; class number; complex multiplication; class polynomials; floating point
11Y16: Number-theoretic algorithms; complexity
11G15: Complex multiplication and moduli of abelian varieties
Related Items
Computing Hilbert Class Polynomials, Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
Uses Software