Algorithms and Complexity

By: Herbert S. Wilf

Write A Review

Hardcover | 9 December 2002 | Edition Number 2

At a Glance

Hardcover
232 Pages

Edition Type
New edition

Dimensions(cm)
22.86 x 15.24 x 1.42

Hardcover

$360.75

or 4 interest-free payments of $90.19 with

Ships in 10 to 15 business days

Algorithms & Complexity, 2nd Edition 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 multiplication, 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. The final chapter is about NP completeness, the theory of a renowned family of seemingly very difficult computational problems that are bound together by familial ties, including a precise formulation of the concept and the statements and proofs of some of the main theorems.

Industry Reviews

"[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

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.