A rigorous version of R.P. Brent's model for the binary Euclidean algorithm

The binary Euclidean algorithm is a modification of the classical Euclidean algorithm for computation of greatest common divisors which avoids ordinary integer division in favour of division by powers of two only. The expectation of the number of steps taken by the binary Euclidean algorithm when ap...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advances in mathematics (New York. 1965) Jg. 290; S. 73 - 143
1. Verfasser:	Morris, Ian D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 26.02.2016
Schlagworte:	Analysis of algorithms Euclidean algorithm Greatest common divisor Random dynamical system Transfer operator secondary Random dynamical system Euclidean algorithm Transfer operator Greatest common divisor Analysis of algorithms primary
ISSN:	0001-8708, 1090-2082
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!