This text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. "Algorithms" is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject.
| ||||||||||||||||||
 Trade In this Item for up to £10.85
Trade in Algorithms for an Amazon.co.uk gift card of up to £10.85, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Special Offer until June 30, 2013: Receive an additional £5 promotional Gift Card, when you trade-in at least £10 worth of books. Learn more
|
Book Description
Frequently Bought Together
Product details
Would you like to update product info or give feedback on images?
|
More About the Authors
Discover books, learn about writers, and more.
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
Most Helpful Customer Reviews
1 of 1 people found the following review helpful
By A. Georgios
Format:Paperback
A very well written book. I used it for an undergraduate algorithms course I attended.
It covers a big range of subjects(which i list since I see no preview possibility provided):
- algorithms for numbers
- divide & conquer
- algorithms for graphs
- greedy algorithms
- dynamic programming
- linear programming
- reductions
- NP completeness
- quantum algorithms
A big plus: the writers really try to give the intuition behind the proofs
I definetely recommend it!
It covers a big range of subjects(which i list since I see no preview possibility provided):
- algorithms for numbers
- divide & conquer
- algorithms for graphs
- greedy algorithms
- dynamic programming
- linear programming
- reductions
- NP completeness
- quantum algorithms
A big plus: the writers really try to give the intuition behind the proofs
I definetely recommend it!
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
3.8 out of 5 stars
39 reviews
37 of 38 people found the following review helpful
3.0 out of 5 stars
Available online for free; lacks some details and explanation
19 Dec 2008
By Kenyon Ralph
- Published on Amazon.com
Format:Paperback|Amazon Verified Purchase
The entire book is available in PDF on Vazirani's website here: [...]
The website says "draft" but it's the same or better (errata corrected) than the print version. (I accidentally bought the print version even though I knew about the PDF. At least I was able to resell it for [...])
I used this book for CSE 101 Design and Analysis of Algorithms at UCSD. It's OK, but the level of detail of algorithms was too low for me to use just this book. I sometimes had to reference Wikipedia and other publications to achieve complete understanding.
The website says "draft" but it's the same or better (errata corrected) than the print version. (I accidentally bought the print version even though I knew about the PDF. At least I was able to resell it for [...])
I used this book for CSE 101 Design and Analysis of Algorithms at UCSD. It's OK, but the level of detail of algorithms was too low for me to use just this book. I sometimes had to reference Wikipedia and other publications to achieve complete understanding.
53 of 58 people found the following review helpful
5.0 out of 5 stars
a masterpiece
13 Mar 2007
By T. Liu
- Published on Amazon.com
Format:Paperback
As a professor in a state university, I learn, teach, and research on computer algorithms. Not many computer books are a joy to read, but
this one is exceptional: It is concise, informative, and inspiring.
I don't know since when computer books are synonymous to boring, lengthy
piles of printed papers filled with screen dumps. Truely innovative
books are rare. Not only does this book explain algorithms clearly, it also tells the stories behind them.
I would consider this book a good complement rather than a substitution
to Corman et al's book Introduction to Algorithms (which is one of the
most widely used textbook for algorithm course). If you just want to
find a book where you can translate the suedo code into a program, this
is not for you. The focus of this book is to explain and to inspire (which is also what I believe the real "Education" should be) rather than
dumping the students' head with codes and rules.
I would also like to mention that the book "the design and analysis of
algorithms" is also a good one. It is good for most colleges at undergraduate level except for a few "top-level" universities.
this one is exceptional: It is concise, informative, and inspiring.
I don't know since when computer books are synonymous to boring, lengthy
piles of printed papers filled with screen dumps. Truely innovative
books are rare. Not only does this book explain algorithms clearly, it also tells the stories behind them.
I would consider this book a good complement rather than a substitution
to Corman et al's book Introduction to Algorithms (which is one of the
most widely used textbook for algorithm course). If you just want to
find a book where you can translate the suedo code into a program, this
is not for you. The focus of this book is to explain and to inspire (which is also what I believe the real "Education" should be) rather than
dumping the students' head with codes and rules.
I would also like to mention that the book "the design and analysis of
algorithms" is also a good one. It is good for most colleges at undergraduate level except for a few "top-level" universities.
13 of 15 people found the following review helpful
5.0 out of 5 stars
My first choice as an instructor
4 Mar 2008
By John R. Black
- Published on Amazon.com
Format:Paperback
I occasionally teach algorithms at CU Boulder to our undergraduates. This book accomplishes what it set out to do: provide a comprehensible (but not comprehensive) treatment of a core piece of Computer Science at an affordable cost.
That we get one of the greatest researchers in the area (Papadimitriou) alongside two other distinguished authors is just icing on the cake.
The first printing had numerous errors, though the online version of the book had already corrected many of them. I haven't used the book since then, but will in the Fall, and I'd expect with the vigor already invested by the authors, the book will be in even better shape.
I'm glad they wrote this thing.. it was long overdue.
That we get one of the greatest researchers in the area (Papadimitriou) alongside two other distinguished authors is just icing on the cake.
The first printing had numerous errors, though the online version of the book had already corrected many of them. I haven't used the book since then, but will in the Fall, and I'd expect with the vigor already invested by the authors, the book will be in even better shape.
I'm glad they wrote this thing.. it was long overdue.
›
Go to Amazon.com to see all 39 reviews
3.8 out of 5 stars
Were these reviews helpful?
Let us know
Listmania!
|
|
Look for similar items by category
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
