A fast Euclidean algorithm for Gaussian integers

DOI10.1006/jsco.2001.0518zbMath1014.11002OpenAlexW2094096244MaRDI QIDQ1600038

George E. Collins

Publication date: 11 June 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ed559d3b642cb5d0746f26c5c39eb63385579af7

zbMATH Keywords

Gaussian integersEuclid's algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers ⋮ Testing elementary function identities using CAD ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders

Cites Work

• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• The Computing Time of the Euclidean Algorithm
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.]
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast Euclidean algorithm for Gaussian integers