Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Algorithmic Number Theory: Efficient Algorithms [Hardcover]

Eric Bach , Jeffrey Shallit
5.0 out of 5 stars  See all reviews (2 customer reviews)
List Price: CDN$ 96.59
Price: CDN$ 91.16 & FREE Shipping. Details
You Save: CDN$ 5.43 (6%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Want it delivered Friday, August 22? Choose One-Day Shipping at checkout.
Save Up to 90% on Textbooks
Hit the books in Amazon.ca's Textbook Store and save up to 90% on used textbooks and 35% on new textbooks. Learn more.
Join Amazon Student in Canada


Book Description

Aug. 26 1996 Foundations of Computing

Algorithmic Number Theory provides a thorough introduction to the design and analysis of algorithms for problems from the theory of numbers. Although not an elementary textbook, it includes over 300 exercises with suggested solutions. Every theorem not proved in the text or left as an exercise has a reference in the notes section that appears at the end of each chapter. The bibliography contains over 1,750 citations to the literature. Finally, it successfully blends computational theory with practice by covering some of the practical aspects of algorithm implementations.The subject of algorithmic number theory represents the marriage of number theory with the theory of computational complexity. It may be briefly defined as finding integer solutions to equations, or proving their non-existence, making efficient use of resources such as time and space. Implicit in this definition is the question of how to efficiently represent the objects in question on a computer. The problems of algorithmic number theory are important both for their intrinsic mathematical interest and their application to random number generation, codes for reliable and secure information transmission, computer algebra, and other areas.Publisher's Note: Volume 2 was not written. Volume 1 is, therefore, a stand-alone publication.


Product Details


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:

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Reviews

4 star
0
3 star
0
2 star
0
1 star
0
5.0 out of 5 stars
5.0 out of 5 stars
Most helpful customer reviews
5.0 out of 5 stars A work of outstanding mathematical scholarship 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. 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?
5.0 out of 5 stars Excellent Reference Oct. 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.
Was this review helpful to you?
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 4.5 out of 5 stars  4 reviews
22 of 22 people found the following review helpful
5.0 out of 5 stars 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
5.0 out of 5 stars 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.
5.0 out of 5 stars 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 6 people found the following review helpful
3.0 out of 5 stars 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.
Search Customer Reviews
Only search this product's reviews

Look for similar items by category


Feedback