Algorithms and Complexity

By Herbert S. Wilf

Book Overview

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.

• Format: Hardcover
• Language: English
• ISBN: 1568811780
• ISBN13: 9781568811789
• Release Date: December 2002
• Publisher: A K PETERS
• Length: 232 Pages
• Weight: 0.95 lbs.
• Dimensions: 0.7" x 6.1" x 9.1"

Customer Reviews

An alternative approach

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.