A Paper-and-Pencil gcd Algorithm for Gaussian Integers

DOI10.2307/30044888zbMATH Open1148.11319OpenAlexW4229869357MaRDI QIDQ5446307

Sándor Szabó

Publication date: 6 March 2008

Published in: The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/30044888

Mathematics Subject Classification ID

Quadratic extensions (11R11) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (2)

On the number of divisions of the Euclidean algorithm applied to Gaussian integers ⋮ ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers 👍 👎
• A fast Euclidean algorithm for Gaussian integers 👍 👎
• An approximating \(k\)-ary GCD algorithm 👍 👎
• The accelerated integer GCD algorithm 👍 👎
• A modular integer GCD algorithm 👍 👎
• Computation of the GCD of polynomials using gaussian transformations and shifting 👍 👎

This page was built for publication: A Paper-and-Pencil gcd Algorithm for Gaussian Integers

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