Algorithms and Complexity

Wilf, Herbert S.

  • 4.00 out of 5 stars
    9 ratings by Goodreads
ISBN 10: 1568811780 ISBN 13: 9781568811789
Published by A K PETERS, 2002
Used Hardcover

From ThriftBooks-Atlanta, AUSTELL, GA, U.S.A. Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since March 24, 2009

This specific item is no longer available.

About this Item

Description:

May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G1568811780I4N00

  • 4.00 out of 5 stars
    9 ratings by Goodreads

Report this item

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

"About this title" may belong to another edition of this title.

Bibliographic Details

Title: Algorithms and Complexity
Publisher: A K PETERS
Publication Date: 2002
Binding: Hardcover
Condition: Very Good
Dust Jacket Condition: No Jacket
Edition: 2nd Edition

Top Search Results from the AbeBooks Marketplace

There are 14 more copies of this book

View all search results for this book