Analysis of a left-shift binary GCD algorithm

DOI10.1006/jsco.1994.1030zbMath0815.11064OpenAlexW2611727100MaRDI QIDQ1338738

Jeffrey O. Shallit, Jonathan P. Sorenson

Publication date: 22 January 1995

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

Full work available at URL: https://doi.org/10.1006/jsco.1994.1030

zbMATH Keywords

complexitybinary GCD algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Continuants with equal values, a combinatorial approach ⋮ Maximal continuants and the Fine-Wilf theorem

This page was built for publication: Analysis of a left-shift binary GCD algorithm