The complexity of class polynomial computation via floating point approximations (Q3055132): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (5 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: gmp / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ECPP / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MPC / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MPFR / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:30, 5 March 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
