Algorithms and Complexity

Algorithms & Complexity, 2nd Edition 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 multiplication, 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. The final chapter is about NP completeness, the theory of a renowned family of seemingly very difficult computational problems that are bound together by familial ties, including a precise formulation of the concept and the statements and proofs of some of the main theorems.Wilf, Herbert S. is the author of 'Algorithms and Complexity', published 2002 under ISBN 9781568811789 and ISBN 1568811780.