Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
$85.50
Qty:1
  • List Price: $90.00
  • Save: $4.50 (5%)
Temporarily out of stock.
Order now and we'll deliver when available.
Order now and we'll deliver when available. We'll e-mail you with an estimated delivery date as soon as we have more information. Your account will only be charged when we ship the item.
Details
Ships from and sold by Amazon.com.
Gift-wrap available.
Trade in your item
Get a $2.93
Gift Card.
Have one to sell? Sell on Amazon
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, Vol. 1: Efficient Algorithms (Foundations of Computing) Hardcover – August 26, 1996

ISBN-13: 978-0262024051 ISBN-10: 0262024055

Buy New
Price: $85.50
11 New from $85.50 20 Used from $70.42
Amazon Price New from Used from
Hardcover
"Please retry"
$85.50
$85.50 $70.42
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Customers Who Viewed This Item Also Viewed

NO_CONTENT_IN_FEATURE

Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now

Product Details

  • Series: Foundations of Computing
  • Hardcover: 496 pages
  • Publisher: The MIT Press (August 26, 1996)
  • Language: English
  • ISBN-10: 0262024055
  • ISBN-13: 978-0262024051
  • Product Dimensions: 9.1 x 7.5 x 1.2 inches
  • Shipping Weight: 2.6 pounds (View shipping rates and policies)
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Best Sellers Rank: #2,470,108 in Books (See Top 100 in Books)

Editorial Reviews

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.

More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

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

Most Helpful Customer Reviews

22 of 22 people found the following review helpful By Charles Denis Xavier (cdx@cse.buffalo.edu) on October 13, 1999
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.
Comment 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
13 of 13 people found the following review helpful By Stuart-Little on May 24, 2002
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.
Comment 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
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.
Comment 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
1 of 6 people found the following review helpful By Roger Bagula on May 18, 2009
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.
Comment 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

Customer Images