𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the greatest common divisor of two values of a polynomial

✍ Scribed by V. Ennola

Publisher
Akadmiai Kiad
Year
1968
Tongue
English
Weight
242 KB
Volume
19
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The calculation of the degree of an appr
The calculation of the degree of an approximate greatest common divisor of two polynomials
✍ Joab R. Winkler; Xin Lao πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 438 KB

The calculation of the degree of an approximate greatest common divisor (AGCD) of two inexact polynomials f (y) and g(y) is a non-trivial computation because it reduces to the estimation of the rank loss of a resultant matrix R( f , g). This computation is usually performed by placing a threshold on

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