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

From MaRDI portal
Revision as of 13:33, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(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

    title
    Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (English)
    0 references
    author
    Eda Cesaratto
    0 references
    Julien Clément
    0 references
    Benoît Daireaux
    0 references
    Loïck Lhote
    0 references
    Brigitte Vallée
    0 references
    publication date
    18 June 2009
    0 references
    zbMATH Keywords
    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
    cites work
    Q4151157
    0 references
    Q3840151
    0 references
    Q5485339
    0 references
    Q3762388
    0 references
    Q3549563
    0 references
    Q3549597
    0 references
    Q5613266
    0 references
    Q4226984
    0 references
    Q5585020
    0 references
    Q4766043
    0 references
    Q4185090
    0 references
    Euclidean dynamics
    0 references

    Identifiers

    Mathematics Subject Classification ID
    11Y16
    0 references
    37C30
    0 references
    68W40
    0 references
    zbMATH DE Number
    5566485
    0 references
    OpenAlex ID
    W2006804687
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1025385&oldid=38588570"
    Powered by MediaWiki