The Probabilistic Method (Hardcover, 3rd Revised edition)

,
Praise for the Second Edition:

"Serious researchers in combinatorics or algorithm design will wish to read the book in its entirety...the book may also be enjoyed on a lighter level since the different chapters are largely independent and so it is possible to pick out gems in one's own area..."
--Formal Aspects of Computing

This Third Edition of The Probabilistic Method reflects the most recent developments in the field while maintaining the standard of excellence that established this book as the leading reference on probabilistic methods in combinatorics. Maintaining its clear writing style, illustrative examples, and practical exercises, this new edition emphasizes methodology, enabling readers to use probabilistic techniques for solving problems in such fields as theoretical computer science, mathematics, and statistical physics.

The book begins with a description of tools applied in probabilistic arguments, including basic techniques that use expectation and variance as well as the more recent applications of martingales and correlation inequalities. Next, the authors examine where probabilistic techniques have been applied successfully, exploring such topics as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Sections labeled "The Probabilistic Lens" offer additional insights into the application of the probabilistic approach, and the appendix has been updated to include methodologies for finding lower bounds for Large Deviations.

The Third Edition also features:

A new chapter on graph property testing, which is a current topic that incorporates combinatorial, probabilistic, and algorithmic techniques

An elementary approach using probabilistic techniques to the powerful Szemeredi Regularity Lemma and its applications

New sections devoted to percolation and liar games

A new chapter that provides a modern treatment of the Erdos-Renyi phase transition in the Random Graph Process

Written by two leading authorities in the field, The Probabilistic Method, Third Edition is an ideal reference for researchers in combinatorics and algorithm design who would like to better understand the use of probabilistic methods. The book's numerous exercises and examples also make it an excellent textbook for graduate-level courses in mathematics and computer science.


R3,078

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles30780
Mobicred@R288pm x 12* Mobicred Info
Free Delivery
Delivery AdviceOut of stock

Toggle WishListAdd to wish list
Review this Item

Product Description

Praise for the Second Edition:

"Serious researchers in combinatorics or algorithm design will wish to read the book in its entirety...the book may also be enjoyed on a lighter level since the different chapters are largely independent and so it is possible to pick out gems in one's own area..."
--Formal Aspects of Computing

This Third Edition of The Probabilistic Method reflects the most recent developments in the field while maintaining the standard of excellence that established this book as the leading reference on probabilistic methods in combinatorics. Maintaining its clear writing style, illustrative examples, and practical exercises, this new edition emphasizes methodology, enabling readers to use probabilistic techniques for solving problems in such fields as theoretical computer science, mathematics, and statistical physics.

The book begins with a description of tools applied in probabilistic arguments, including basic techniques that use expectation and variance as well as the more recent applications of martingales and correlation inequalities. Next, the authors examine where probabilistic techniques have been applied successfully, exploring such topics as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Sections labeled "The Probabilistic Lens" offer additional insights into the application of the probabilistic approach, and the appendix has been updated to include methodologies for finding lower bounds for Large Deviations.

The Third Edition also features:

A new chapter on graph property testing, which is a current topic that incorporates combinatorial, probabilistic, and algorithmic techniques

An elementary approach using probabilistic techniques to the powerful Szemeredi Regularity Lemma and its applications

New sections devoted to percolation and liar games

A new chapter that provides a modern treatment of the Erdos-Renyi phase transition in the Random Graph Process

Written by two leading authorities in the field, The Probabilistic Method, Third Edition is an ideal reference for researchers in combinatorics and algorithm design who would like to better understand the use of probabilistic methods. The book's numerous exercises and examples also make it an excellent textbook for graduate-level courses in mathematics and computer science.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Wiley-Blackwell

Country of origin

United States

Series

Wiley Series in Discrete Mathematics and Optimization

Release date

August 2008

Availability

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

First published

August 2008

Authors

,

Dimensions

240 x 160 x 20mm (L x W x T)

Format

Hardcover

Pages

352

Edition

3rd Revised edition

ISBN-13

978-0-470-17020-5

Barcode

9780470170205

Categories

LSN

0-470-17020-4



Trending On Loot