Algorithms and Complexity by Herbert S Wilf
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."[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
Herbert S. Wilf
| SKU | Unavailable |
| ISBN 13 | 9781568811789 |
| ISBN 10 | 1568811780 |
| Title | Algorithms and Complexity |
| Author | Herbert S Wilf |
| Condition | Unavailable |
| Publisher | Taylor & Francis Inc |
| Year published | 2002-12-09 |
| Number of pages | 232 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |