SALE ON NOW! PROMOTIONS

Close Notification

Your cart does not contain any items

$166

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
A K Peters
09 December 2002
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.
By:  
Imprint:   A K Peters
Country of Publication:   United States
Edition:   2nd edition
Dimensions:   Height: 229mm,  Width: 152mm,  Spine: 18mm
Weight:   430g
ISBN:   9781568811789
ISBN 10:   1568811780
Pages:   232
Publication Date:  
Audience:   College/higher education ,  A / AS level ,  Further / Higher Education
Format:   Hardback
Publisher's Status:   Active

Herbert S. Wilf

Reviews for Algorithms and Complexity

[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


See Also