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

On the asymptotic integer algorithm

โœ Scribed by T.C. Hu

Book ID
107824654
Publisher
Elsevier Science
Year
1970
Tongue
English
Weight
817 KB
Volume
3
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The integer cubic algorithm
The integer cubic algorithm
โœ Efim A. Galperin ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 625 KB
Improvements on the accelerated integer
Improvements on the accelerated integer GCD algorithm
โœ Mohamed S. Sedjelmaci; Christian Lavault ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 493 KB

The present paper analyses and presents several improvements to the algorithm for finding the (a, b)-pairs used in the k-ary reduction of the right-shift k-ary integer GCD algorithm. While the worst-case complexity of the "Accelerated integer GCD algorithm" is 0( (log,( k))'), we show that the worst

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.