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

Efficient Checkers for Number-Theoretic Computations

โœ Scribed by L.M. Adleman; M.D. Huang; K. Kompella

Book ID
112252174
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
706 KB
Volume
121
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complexity of Computer Computations || E
Complexity of Computer Computations || Efficient Iterations for Algebraic Numbers
โœ Miller, Raymond E.; Thatcher, James W.; Bohlinger, Jean D. ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Springer US ๐ŸŒ English โš– 965 KB

The Symposium On The Complexity Of Computer Compu Tations Was Held At The Ibm Thomas J. Watson Research Center In Yorktown Heights, New York, March 20-22, 1972. These Proceedings Contain All Papers Presented At The Symposium Together With A Transcript Of The Concluding Panel Discussion And A Compreh

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