Publication:3832627

zbMath0677.10001MaRDI QIDQ3832627

Graham H. Norton

Publication date: 1989

zbMATH Keywords

Euclidean algorithm; integer greatest common divisor algorithm; shift-divide instruction

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

11-04: Software, source code, etc. for problems pertaining to number theory

11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors

Related Items

\((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.], On the worst case of three algorithms for computing the Jacobi symbol, On the asymptotic analysis of the Euclidean algorithm