The accelerated integer GCD algorithm
From MaRDI portal
Publication:4371587
DOI10.1145/200979.201042zbMath0883.11055DBLPjournals/toms/Weber95OpenAlexW2136714656WikidataQ56047913 ScholiaQ56047913MaRDI QIDQ4371587
Publication date: 26 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1995-21/
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (9)
An approximating \(k\)-ary GCD algorithm ⋮ GCD calculation in the search task of pseudoprime and strong pseudoprime numbers ⋮ Improvements on the accelerated integer GCD algorithm ⋮ An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ An effective programming of GCD algorithms for natural numbers ⋮ Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm ⋮ Polynomial greatest common divisor as a solution of system of linear equations ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ On Schönhage's algorithm and subquadratic integer gcd computation
Uses Software
This page was built for publication: The accelerated integer GCD algorithm
