An approximating \(k\)-ary GCD algorithm (Q2361674): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1995080216060147 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2555912531 / rank | |||
Normal rank | |||
Latest revision as of 10:15, 30 July 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
