The Brun gcd algorithm in high dimensions is almost always subtractive (Q2409010)

From MaRDI portal
Revision as of 12:25, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Brun gcd algorithm in high dimensions is almost always subtractive
scientific article

    Statements

    The Brun gcd algorithm in high dimensions is almost always subtractive (English)
    0 references
    10 October 2017
    0 references
    multiple gcd algorithm
    0 references
    multidimensional continued fraction
    0 references
    analytic combinatorics
    0 references
    Dirichlet generating functions
    0 references
    average-case analysis
    0 references
    transfer operator
    0 references
    dynamical analysis
    0 references
    Tauberian theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers