An approximating \(k\)-ary GCD algorithm (Q2361674)

From MaRDI portal
Revision as of 14:38, 3 August 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
An approximating \(k\)-ary GCD algorithm
scientific article

    Statements

    An approximating \(k\)-ary GCD algorithm (English)
    0 references
    30 June 2017
    0 references
    Euclidean GCD algorithm
    0 references
    \(k\)-ary gcd
    0 references
    Weber-Jebelean algorithm
    0 references
    Farey series
    0 references

    Identifiers