Algorithms and Complexity

Name: Algorithms and Complexity
Brand: Taylor & Francis Ltd
Price: 89.99 AUD
Availability: BackOrder

By: Herbert S. Wilf

Write A Review

Paperback | 30 September 2020 | Edition Number 2

At a Glance

Paperback
219 Pages

Edition Type
New edition

Dimensions(cm)
22.9 x 15.2 x 1.6

Paperback

RRP $101.00

$89.99

11%OFF

or 4 interest-free payments of $22.50 with

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

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.

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.