Algorithms and complexity

By: Wilf, Herbert S
Material type: TextTextPublisher: Englewood Cliffs, N.J. Prentice-Hall 1986Description: vi, 231 p.ISBN: 013022054XSubject(s): Problem solving - Data processing | Computer algorithms | Computational complexityDDC classification: 511.8 Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Item location Collection Call number Status Date due Barcode
Books Vikram Sarabhai Library
Slot 1359 (0 Floor, East Wing) Non-fiction 511.8 W4A5 (Browse shelf) Available 186037

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.

There are no comments for this item.

to post a comment.

Powered by Koha