Algorithmic number theory Vol. 1
Material type: TextLanguage: English Series: Efficient Algorithms ; 1Publication details: London Massachusetts Institute of Technology 1997Description: xiii, 512pISBN: 9780262024051 (HB)Subject(s): Number theory | Efficient Algorithms | Algoritmen | MathematicsCurrent library | Home library | Call number | Materials specified | Status | Date due | Barcode |
---|---|---|---|---|---|---|
IMSc Library | IMSc Library | 510.5/511 BAC (Browse shelf (Opens below)) | Available | 66535 |
Includes Index.
Includes Bibliography (p 389-486).
1. Introduction
2. Fundamentals of Number Theory
3. A Survey of Complexity Theory
4. The Greatest Common Divisor
5. Computing in Z/(n)
6. Finite Fields
7. Solving Equations over Finite Fields
8. Prime Numbers: Facts and Heuristics
9. Prime Numbers: Basic Algorithms
There are no comments on this title.