This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
Review
"[The examples] are selected with great care and enable the reader to concentrate directly on the main features of the demonstrated topics. . . . The book can be warmly recommended to those willing to learn (or teach) basic ideas of computational mathematics." -EMS Newsletter, March 2004
About the Author
Herbert S. Wilf is the Thomas A. Scott Professor of Mathematics at the University of Pennsylvania. In 1998 he received the Leroy P. Steele Prize for Seminal Contribution to Research, awarded by the American Mathematical Society, and in 1996 he was awarded the Deborah and Franklin Tepper Haimo Award for Distinguished College or University Teaching of mathematics.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
5 of 5 people found the following review helpful:
5.0 out of 5 stars
An alternative approach,
By
This review is from: Algorithms and Complexity (Hardcover)
I have really enjoyed this book. It introduces all the mathematical stuff at the beginning, and draws the clear link between recurrences and differential equations. I find this way of doing things very handy and far surerior to the way famous books on algorithms like Cormen et al. does it. To a fresh student taking his or her first course in algorithms it may be a rough start, but it is definitely an interresting book.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
An algorithm is a method for solving a class of problems on a computer. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
strong pseudoprimality test, accepting calculation, flow augmenting path, helpful edge, largest independent set, input bit string, network flow problem, graph coloring problem, unlabeled graphs, edge capacities, chromatic polynomial, splitting elements, proper colorings, maximum independent set, accepting computation, chromatic number, canonical factorization, layered network, terminal vertex, checking algorithm, primality testing, recursive program, tape head, polynomial time Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Traveling Salesman Problem, Mathematical Preliminaries, The Network Flow Problem Figure, Journal of Algorithms, Mathematics of Computation New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
An algorithm is a method for solving a class of problems on a computer. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
strong pseudoprimality test, accepting calculation, flow augmenting path, helpful edge, largest independent set, input bit string, network flow problem, graph coloring problem, unlabeled graphs, edge capacities, chromatic polynomial, splitting elements, proper colorings, maximum independent set, accepting computation, chromatic number, canonical factorization, layered network, terminal vertex, checking algorithm, primality testing, recursive program, tape head, polynomial time Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Traveling Salesman Problem, Mathematical Preliminaries, The Network Flow Problem Figure, Journal of Algorithms, Mathematics of Computation New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 8
books:
See all 8 books this book cites
39
books
cite this book:
See all 39 books citing this book
- An Introduction to the Theory of Numbers (Oxford Science Publications) by G. H. Hardy on page 163
- Graphical Evolution (Wiley Series in Discrete Mathematics and Optimization) by Edgar M. Palmer on page 208
- Graph Algorithms (Computer Software Engineering Series) by Shimon Even on page 126
- Monte Carlo by Linda C. Wright on page 163
- Fundamentals of Number Theory (Dover Books on Mathematics) by William J. LeVeque on page 163
See all 8 books this book cites
- Contemporary Cryptology: The Science of Information Integrity by Gustavus J. Simmons on page 277, page 286, and page 538
- Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) by Donald L. Kreher in Back Matter (1), and Back Matter (2)
- Numerical Analysis for Statisticians by Kenneth Lange on page 11, and page 251
- Sorting: A Distribution Theory by Hosam M. Mahmoud in Back Matter (1), and Back Matter (2)
- Graph Theory and Its Applications by Jonathan L. Gross in Back Matter (1), and Back Matter (2)
See all 39 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
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 Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
