A Greatest Common Divisor Algorithm

DOI10.1142/S0218196798000296MaRDI QIDQ4704559zbMATH OpenFDO

Authors Ari Belenkiy, Raimundas Vidunas

Publication date 20 June 2001

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218196798000296

zbMATH Keywords

Euclid's algorithm

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1254258
• A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers
• scientific article; zbMATH DE number 3341178

Cites work

• Euclid's Algorithm for Large Numbers

Cited in

(15)

• Mutual-subtraction algorithm and its application in ancient China
• Generating the greatest common divisor, and limitations of primitive recursive algorithms
• A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers
• Partial correctness of GCD algorithm
• On the complexity of the extended Euclidean algorithm (extended abstract)
• scientific article; zbMATH DE number 4031770 (Why is no real title available?)
• scientific article; zbMATH DE number 4108845 (Why is no real title available?)
• scientific article; zbMATH DE number 60228 (Why is no real title available?)
• scientific article; zbMATH DE number 4127290 (Why is no real title available?)
• scientific article; zbMATH DE number 1254258 (Why is no real title available?)
• A Geometrical Method for Finding an Explicit Formula for the Greatest Common Divisor
• scientific article; zbMATH DE number 3305966 (Why is no real title available?)
• scientific article; zbMATH DE number 3335208 (Why is no real title available?)
• scientific article; zbMATH DE number 3341178 (Why is no real title available?)
• Robust HGCD with no backup steps

This page was built for publication: A Greatest Common Divisor Algorithm

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