Prime Numbers : Computational Perspective
Material type:
TextLanguage: English Publication details: New York Springer 2001Description: xv, 545pISBN: - 0387947779 (HB)
BOOKS
| Home library | Call number | Materials specified | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
| IMSc Library | 511.11-3 CRA (Browse shelf(Opens below)) | Available | 46049 |
Includes index
Includes bibliography (p. 501-525) and referencea
1. Primes! 2. Number-Theoretical Tools 3. Recognizing Primes and Composites 4. Primality Proving 5. Exponential Factoring Algorithms 6. Subexponential Factoring Algorithms 7. Elliptic Curve Arithmetic 8. The Ubiquity of Prime Numbers 9. Fast Algorithms for Large-Integer Arithmetic.
The title has enhancement files, program code and other data available for delivery via the TELOS Web site; www telospub.com, including updates to this algorithm library, sound and graphics files. All programs are coded in C and Fortran.
There are no comments on this title.