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

Algorithms for Jacobi symbol. JSC 1998

โœ Scribed by Eikenberry, Sorenson.

Book ID
127401692
Tongue
English
Weight
101 KB
Category
Library

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Algorithms for Computing the J
Efficient Algorithms for Computing the Jacobi Symbol
โœ S.M. Eikenberry; J.P. Sorenson ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 464 KB

We present two new algorithms for computing the Jacobi Symbol: the right-shift and left-shift k-ary algorithms. For inputs of at most n bits in length, both algorithms take O(n 2 / log n) time and O(n) space. This is asymptotically faster than the traditional algorithm, which is based in Euclid's al

Euclidean algorithm for numerical polyno
Euclidean algorithm for numerical polynomial GCD. JSC 1998
โœ Beckermann, Labahn. ๐Ÿ“‚ Library ๐ŸŒ English โš– 201 KB

In this paper we provide a taet, numerically stable algorithm to determine when two given polynomials a arid b are relatively prime and remain relatively prime even after small perturbations of their coefficients. Such a problem is important in ninny applications where input data are only available

On the worst case of three algorithms fo
On the worst case of three algorithms for computing the Jacobi symbol
โœ Jeffrey Shallit ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 803 KB

We study the worst-case behavior of three iterative algorithms for computing the Jacobi symbol (~). Each algorithm is similar in format to the Euclidean algorithm for computing gcd(u, v). Eisenstein's algorithm chooses an even quotient at each step. It is shown that the worst case occurs when u = 2