Computing GCD's by normalized division

DOI10.1007/BF01614149zbMath0746.68043MaRDI QIDQ1191635

Graham H. Norton

Publication date: 27 September 1992

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

greatest common divisordivision algorithm

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of Euclidean algorithms for polynomials over finite fields
• On the asymptotic analysis of the Euclidean algorithm
• Evaluation of Porter's constant
• Computational problems associated with Racah algebra
• Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for $GF(q)[x$]
• On a theorem of Heilbronn
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• Algorithm and bound for the greatest common divisor of n integers
• The number of steps in the Euclidean algorithm

This page was built for publication: Computing GCD's by normalized division