An approximating \(k\)-ary GCD algorithm (Q2361674)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6737908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximating \(k\)-ary GCD algorithm |
scientific article; zbMATH DE number 6737908 |
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
0.8053584098815918
0 references
0.7793442010879517
0 references
0.7713736891746521
0 references
