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...

Celý popis

Podrobná bibliografia

Vydané v:	Advances in mathematics (New York. 1965) Ročník 290; s. 73 - 143
Hlavný autor:	Morris, Ian D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 26.02.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!