The complexity of class polynomial computation via floating point approximations (Q3055132): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:45, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of class polynomial computation via floating point approximations |
scientific article |
Statements
The complexity of class polynomial computation via floating point approximations (English)
0 references
7 November 2010
0 references
complex multiplication
0 references
elliptic curves
0 references
class polynomials
0 references
floating point
0 references
class number
0 references
modular functions
0 references
