Computing Hilbert Class Polynomials
| dc.creator | Belding, Juliana | |
| dc.creator | Bröker, Reinier | |
| dc.creator | Enge, Andreas | |
| dc.creator | Lauter, Kristin | |
| dc.date | 2008-02-07 | |
| dc.date.accessioned | 2026-07-07T09:19:16Z | |
| dc.date.available | 2026-07-07T09:19:16Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0802.0979 | |
| dc.identifier | http://arxiv.org/abs/0802.0979 | |
| dc.identifier | Dans ANTS-VIII - Eighth Algorithmic Number Theory Symposium (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154327 | |
| dc.subject | Number Theory | |
| dc.title | Computing Hilbert Class Polynomials | |
| dc.type | text |