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

Full description

Saved in:

Bibliographic Details
Published in:	Advances in mathematics (New York. 1965) Vol. 290; pp. 73 - 143
Main Author:	Morris, Ian D.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 26.02.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!