Algorithms and Complexity

Wilf, Herbert S.

ISBN 10: 0130219738 / ISBN 13: 9780130219732

Published by Stationery Office, The, 1986

Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP17869483

Synopsis:

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 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.

Bibliographic Details

Title: Algorithms and Complexity
Publisher: Stationery Office, The
Publication Date: 1986
Binding: Hardcover
Condition: Good
Edition: 1st.