Computing modular polynomials in quasi-linear time (Q3055173): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 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: MPC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing elliptic curves of prime order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Modular Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the coefficients of the transformation polynomials for the elliptic modular function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5735284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of modular functions using Newton iterations and the AGM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4213383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of class polynomial computation via floating point approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing elliptic curves over finite fields using double eta-quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular curves of composite level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Isogenies between Elliptic Curves Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPFR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the number of points on an elliptic curve over a finite field: algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperelliptic modular curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5631239 / rank
 
Normal rank

Latest revision as of 11:12, 3 July 2024

scientific article
Language Label Description Also known as
English
Computing modular polynomials in quasi-linear time
scientific article

    Statements

    Computing modular polynomials in quasi-linear time (English)
    0 references
    0 references
    7 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    modular polynomials
    0 references
    modular functions
    0 references
    modular group
    0 references
    Schläfli equations
    0 references
    0 references
    0 references
    0 references