𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for product computations on computer

✍ Scribed by K.C. Wong; S.Sitharama Iyengar

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
263 KB
Volume
6
Category
Article
ISSN
0096-3003

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

On an Efficient Algorithm for Big Ration
On an Efficient Algorithm for Big Rational Number Computations by Parallel p-adics
✍ Carla Limongelli πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 451 KB

This paper presents an algorithm for evaluating an arithmetic expression over "big" rational numbers. The method exploits \(p\)-adic arithmetic and parallelism to achieve efficiency. Roughly, the algorithm begins by mapping the input rational numbers to the related p-adic codes for several prime ba