An effective programming of GCD algorithms for natural numbers (Q2225857)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective programming of GCD algorithms for natural numbers |
scientific article; zbMATH DE number 7309089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective programming of GCD algorithms for natural numbers |
scientific article; zbMATH DE number 7309089 |
Statements
An effective programming of GCD algorithms for natural numbers (English)
0 references
11 February 2021
0 references
greatest common divisor
0 references
Euclidean GCD algorithm
0 references
\(k\)-ary algorithm
0 references
approximating \(k\)-ary algorithm
0 references
0 references
0.8612372
0 references
0 references
0.85679954
0 references
0.8554872
0 references
0.85393965
0 references
0.8525455
0 references
