Amazon cover image
Image from Amazon.com
Image from Google Jackets

Algorithmic number theory Vol. 1

By: Contributor(s): Material type: TextTextLanguage: English Series: Efficient Algorithms ; 1Publication details: London Massachusetts Institute of Technology 1997Description: xiii, 512pISBN:
  • 9780262024051 (HB)
Subject(s):
Contents:
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
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified Status Date due Barcode
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.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India