The system will be going down for regular maintenance. Please save your work and logout.
Computing Hilbert Class Polynomials
Language
en
Communication dans un congrès avec actes
This item was published in
ANTS-VIII - Eighth Algorithmic Number Theory Symposium, 2008-05-17, Banff. 2008, vol. 5011, p. 282-295
Springer-Verlag
English Abstract
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese ...Read more >
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm which uses the class group action on CM-curves over finite fields. Our run time analysis gives tighter bounds for the complexity of all known algorithms for computing $H_D$ , and we show that all methods have comparable run times.Read less <
English Keywords
class polynomial
p-adic lifting
algorithm
complexity
Origin
Hal imported