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

Multidimensional greatest common divisor and Lehmer algorithms

โœ Scribed by M. S. Waterman

Publisher
Springer Netherlands
Year
1977
Tongue
English
Weight
659 KB
Volume
17
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On primitive recursive algorithms and th
On primitive recursive algorithms and the greatest common divisor function
โœ Yiannis N. Moschovakis ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 341 KB

We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein's) cannot be matched in e ciency by primitive recurs

A carry-free algorithm for finding the g
A carry-free algorithm for finding the greatest common divisor of two integers
โœ George B. Purdy ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 503 KB

We investigate a variant of the so-called "binary" algorithm for finding the GCD (greatest common divisor) of two numbers which requires no comparisons. We show that when implemented with carry-save hardware, it can be used to find the modulo B inverse of an n-bit binary integer in a time proportion