CDN$ 96.36
  • List Price: CDN$ 102.74
  • You Save: CDN$ 6.38 (6%)
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.ca.
Gift-wrap available.
Quantity:1
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Algorithmic Number Theory: Efficient Algorithms Hardcover – Aug 26 1996


See all formats and editions Hide other formats and editions
Amazon Price New from Used from
Hardcover
"Please retry"
CDN$ 96.36
CDN$ 70.00 CDN$ 122.51

2014 Books Gift Guide for Children & Teens
Browse our featured books to find gift ideas for the boys or girls on your holiday shopping list this year!


Product Details

  • Hardcover: 528 pages
  • Publisher: The MIT Press; 1 edition (Aug. 26 1996)
  • Language: English
  • ISBN-10: 0262024055
  • ISBN-13: 978-0262024051
  • Product Dimensions: 18.4 x 3.2 x 23.5 cm
  • Shipping Weight: 1.2 Kg
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Bestsellers Rank: #1,568,438 in Books (See Top 100 in Books)
  • See Complete Table of Contents

Product Description

Review

"[Algorithmic Number Theory] is an enormous achievement andan extremely valuable reference." Donald E. Knuth, Emeritus, Stanford University

About the Author

Eric Bach is Professor, Computer Sciences Department, University of Wisconsin. Jeffrey Shallit is Associate Professor, Department of Computer Science, University of Waterloo.

Inside This Book (Learn More)
First Sentence
The goal of this book is to provide a thorough introduction to the design and analysis of algorithms for problems from the theory of numbers. Read the first page
Explore More
Concordance
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Customer Reviews

5.0 out of 5 stars
5 star
2
4 star
0
3 star
0
2 star
0
1 star
0
See both customer reviews
Share your thoughts with other customers

Most helpful customer reviews

Format: Hardcover
This book is a valuable reference -- a real work of mathematical scholarship concerning problems from elementary number theory, such as primality testing, square roots mod p, quadratic residues, polynomial factoring, and generation of random primes -- algorithms for which efficient solutions are known. However, the lattice reduction algorithm of Lenstra, Lenstra, and Lovasz is not covered.
Three outstanding features of this book are:
1) The extensive chapter end notes that provide a comprehensive review of the history and state of the art for each topic addressed in the book. These notes are so detailed that they are like having a mini book within a book. Anyone doing research in the field would do well to own this book for this reason alone.
2) Exhaustive bibliography, all together there are over 1750 bibliographic entries.
3) Applications of the ERH/ GRH (Extended and Generalized Riemann Hypothesis). I know of no other single reference that covers the consequences of these conjectures being true in terms of primality testing, quadratic non residue testing, primitive root finding and so on.
The algorithms are presented in pseudo code and practical implementation remarks are reserved for the notes section of each chapter.
Recommended for upper level undergraduates and all the way on up to faculty.
As a bonus the book is a real pleasure to view due to the excellent job done in the layout and typesetting.
I look forward to volume two which will focus on algorithms for intractable problems for which efficient (polynomial time) algorithms are NOT known such as factoring and the discrete log problem.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.
Format: Hardcover
Bach and Shallit have done a wonderful job of preparing a survey of Number Theoretic Algorithms. After covering the basic mathematical material and complexity theory background, the book plunges in to discuss computation in (Z/(n)) and various algorithms in Finite Fields.
The part of the book that I like best are the last two chapters which deal with prime numbers and algorithms for primality testing. The authors have done an exhaustive survey of this area. Proofs of the correctness of the algorithms are wonderfully concise and lucid. The second volume [not published yet] will discuss problems for which efficient algorithms are currently unknown for example factoring, discrete log etc. The authors also promise coverage of the Adleman, Huang proof that Primes \in ZPP.
Exercises have been chosen carefully, and most of the solutions are available as an appendix (for the others references are given). Finally the bibliography is *huge* with close to 2000 citations. Overall an excellent book for reference and for a one stop introduction to the wonderful area of Algorithmic Number Theory.
Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again.

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: 4 reviews
22 of 22 people found the following review helpful
Excellent Reference Oct. 13 1999
By Charles Denis Xavier (cdx@cse.buffalo.edu) - Published on Amazon.com
Format: Hardcover
Bach and Shallit have done a wonderful job of preparing a survey of Number Theoretic Algorithms. After covering the basic mathematical material and complexity theory background, the book plunges in to discuss computation in (Z/(n)) and various algorithms in Finite Fields.
The part of the book that I like best are the last two chapters which deal with prime numbers and algorithms for primality testing. The authors have done an exhaustive survey of this area. Proofs of the correctness of the algorithms are wonderfully concise and lucid. The second volume [not published yet] will discuss problems for which efficient algorithms are currently unknown for example factoring, discrete log etc. The authors also promise coverage of the Adleman, Huang proof that Primes \in ZPP.
Exercises have been chosen carefully, and most of the solutions are available as an appendix (for the others references are given). Finally the bibliography is *huge* with close to 2000 citations. Overall an excellent book for reference and for a one stop introduction to the wonderful area of Algorithmic Number Theory.
13 of 13 people found the following review helpful
A work of outstanding mathematical scholarship May 24 2002
By Stuart-Little - Published on Amazon.com
Format: Hardcover
This book is a valuable reference -- a real work of mathematical scholarship concerning problems from elementary number theory, such as primality testing, square roots mod p, quadratic residues, polynomial factoring, and generation of random primes -- algorithms for which efficient solutions are known.

Related algorithms such as the lattice reduction algorithm of Lenstra, Lenstra, and Lovasz, and elliptic curve point counting over finite fields are not covered.

Three outstanding features of this book are:

1) The extensive chapter end notes that provide a comprehensive review of the history and state of the art for each topic addressed in the book. These notes are so detailed that they are like having a mini book within a book. Anyone doing research in the field would do well to own this book for this reason alone.

2) Exhaustive bibliography, all together there are over 1750 bibliographic entries.

3) Applications of the RH and ERH(Riemann Hypothesis and Extended Riemann Hypothesis). I know of no other single reference that covers the consequences of these conjectures being true in terms of primality testing, quadratic non-residue testing, primitive root finding and so on.

The algorithms are presented in pseudo code and practical implementation remarks are reserved for the notes section of each chapter.

Recommended for upper level undergraduates and all the way on up to faculty.

As a bonus the book is a real pleasure to view due to the excellent job done in the layout and typesetting.

I look forward to volume two which will focus on algorithms for intractable problems for which efficient (polynomial time) algorithms are NOT known such as factoring and the discrete log problem.
Wonderful summary of computational number theory Nov. 3 2013
By Joshua E. Hill - Published on Amazon.com
Format: Hardcover
This is a wonderful summary of the standard algorithms used in computational number theory. It's writing is clear, the proofs are lovely, and the selection of topics is nice.
1 of 7 people found the following review helpful
Rash Math or padded volume? May 18 2009
By Roger Bagula - Published on Amazon.com
Format: Hardcover
It is the treatment of the Riemann hypothesis that really bothers me:mostly
the ERH ( extended Riemann Hypothesis) which is introduced with a badly or incompletely defined phi(n) function).
With chapter notes and problem solutions there is less to this book than the size ( page number suggests) so this volume is more of notice by what is left out or left to volume two.
The algorithms are all in pseudo-code and there is no bridge to actual computer programs that you might expect from where Jeffrey Shallit teaches
( Maple country).
I was disappointed with this book and I dislike the abstract mathematics style in a book that is supposed to be about computer algorithms.
You are left with a definite "snob without a cause" feeling.


Feedback