An effective programming of GCD algorithms for natural numbers

DOI10.3103/S1066369X20060018zbMath1459.11006OpenAlexW3048110895MaRDI QIDQ2225857

Sh. T. Ishmukhametov, Arkan Mohammed Al Halidi

Publication date: 11 February 2021

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x20060018

zbMATH Keywords

greatest common divisor\(k\)-ary algorithmapproximating \(k\)-ary algorithmEuclidean GCD algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Approximation algorithms (68W25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm
• An approximating \(k\)-ary GCD algorithm
• Two Fast GCD Algorithms
• The accelerated integer GCD algorithm
• Unnamed Item

This page was built for publication: An effective programming of GCD algorithms for natural numbers