An effective programming of GCD algorithms for natural numbers

DOI10.3103/S1066369X20060018MaRDI QIDQ2225857zbMATH OpenOpenAlexFDO

Authors Arkan Mohammed Al Halidi, Sh. T. Ishmukhametov

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

\(k\)-ary algorithmapproximating \(k\)-ary algorithmEuclidean GCD algorithmgreatest common divisor

Mathematics Subject Classification ID

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

Recommendations

• Fast computation of GCDs
• The accelerated integer GCD algorithm
• An approximating k-ary GCD algorithm
• A modular integer GCD algorithm
• Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
• On primitive recursive algorithms and the greatest common divisor function
• Two Fast GCD Algorithms
• Two fast parallel GCD algorithms of many integers
• An improved parallel algorithm for integer GCD
• scientific article; zbMATH DE number 1263309

Cites work

• An approximating k-ary GCD algorithm
• Calculation of Bezout coefficients for a k-ary GCD algorithm
• scientific article; zbMATH DE number 1263309 (Why is no real title available?)
• The accelerated integer GCD algorithm
• Two Fast GCD Algorithms

Cited in

(1)

• An approximating k-ary GCD algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225857)