Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5317673 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two Fast GCD Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The accelerated integer GCD algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4234183 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximating \(k\)-ary GCD algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5772619 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Acceleration of Euclidean Algorithm and Rational Number Reconstruction / rank | |||
Normal rank | |||
Revision as of 02:44, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm |
scientific article |
Statements
Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (English)
0 references
13 February 2018
0 references
Euclidean algorithm
0 references
extended Euclidean algorithm
0 references
\(k\)-ary GCD algorithm
0 references
calculation of inverse elements by module
0 references
