Randomized Algorithms (Hardcover, New)

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	August 1995
First published:	1995
Authors:	Rajeev Motwani • Prabhakar Raghavan
Dimensions:	264 x 178 x 30mm (L x W x T)
Format:	Hardcover
Pages:	496
Edition:	New
ISBN-13:	978-0-521-47465-8
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling Promotions
LSN:	0-521-47465-5
Barcode:	9780521474658

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!