Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen
From MaRDI portal
Publication:1146706
DOI10.1007/BF01224981zbMath0448.10004MaRDI QIDQ1146706
Publication date: 1980
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01224981
11A55: Continued fractions
11A63: Radix representation; digital problems
11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors
Related Items
On the worst case of three algorithms for computing the Jacobi symbol, Euclidean algorithms are Gaussian
Cites Work