Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385)

From MaRDI portal
Revision as of 23:12, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
scientific article

    Statements

    Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    Euclid algorithm
    0 references
    divide and conquer algorithms
    0 references
    fast multiplication
    0 references
    analysis of algorithms
    0 references
    transfer operators
    0 references
    Perron formula
    0 references