Algorithms and Complexity (Hardcover, 2nd edition)

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.

General

Imprint:	A K Peters Ltd
Country of origin:	United States
Release date:	December 2002
First published:	2002
Authors:	Herbert S. Wilf
Dimensions:	229 x 152 x 17mm (L x W x T)
Format:	Hardcover
Pages:	232
Edition:	2nd edition
ISBN-13:	978-1-56881-178-9
Categories:	Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	1-56881-178-0
Barcode:	9781568811789

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!