An approximating \(k\)-ary GCD algorithm (Q2361674): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:47, 2 February 2024
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