From
ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since March 24, 2009
May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G1568811780I4N00
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.
About the Author: Herbert S. Wilf
Title: Algorithms and Complexity
Publisher: A K PETERS
Publication Date: 2002
Binding: Hardcover
Condition: Very Good
Dust Jacket Condition: No Jacket
Edition: 2nd Edition