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

From MaRDI portal
Revision as of 11:15, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    An approximating \(k\)-ary GCD algorithm (English)
    0 references
    publication date
    30 June 2017
    0 references
    zbMATH DE Number
    6737908
    0 references
    zbMATH Keywords
    Euclidean GCD algorithm
    0 references
    \(k\)-ary gcd
    0 references
    Weber-Jebelean algorithm
    0 references
    Farey series
    0 references
    OpenAlex ID
    W2555912531
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2361674&oldid=37242410"
    Powered by MediaWiki