𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating the Greatest Common Divisor, and Limitations of Primitive Recursive Algorithms

✍ Scribed by L. van den Dries

Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
290 KB
Volume
3
Category
Article
ISSN
1615-3375

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

Estimation of the Greatest Common Diviso
Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
✍ Dimitrios Christou; Marilena Mitrouli πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons βš– 146 KB

The computation of the Greatest Common Divisor (GCD) of a set of more than two polynomials is a non-generic problem. There are cases where iterative methods of computing the GCD of many polynomials, based on the Euclidean algorithm, fail to produce accurate results, when they are implemented in a so