๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Partial Evaluation of the Euclidean Algorithm, Revisited

โœ Scribed by C.S. Lee

Book ID
110284900
Publisher
Springer
Year
1999
Tongue
English
Weight
58 KB
Volume
12
Category
Article
ISSN
1388-3690

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Computing Time of the Euclidean Algo
The Computing Time of the Euclidean Algorithm
โœ Collins, George E. ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 1006 KB
On the asymptotic analysis of the Euclid
On the asymptotic analysis of the Euclidean algorithm
โœ G.H. Norton ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

Let N > 2 and 8 > 0. For uniformly distributed integers in the interval I-1, N], the Euclidean algorithm requires an average of 121n2( 1 divisions, where C is Porter's constant.