Amazon.com: The Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization) (9780471535881): Noga Alon, Joel H. Spencer: Books
The Probabilistic Method and over one million other books are available for Amazon Kindle. Learn more

Buy Used
Used - Good See details
$47.09 & this item ships for FREE with Super Saver Shipping. Details

or
Sign in to turn on 1-Click ordering.
 
   
Kindle Edition
 
   
Have one to sell? Sell yours here
The Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization)
 
 
Start reading The Probabilistic Method on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

The Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization) [Hardcover]

Noga Alon (Author), Joel H. Spencer (Author)
5.0 out of 5 stars  See all reviews (4 customer reviews)


Available from these sellers.


Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $71.50  
Hardcover $99.13  
Hardcover, November 1, 1991 --  
There is a newer edition of this item:
The Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization) The Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization) 5.0 out of 5 stars (4)
$99.13
In Stock.

Book Description

November 1, 1991 0471535885 978-0471535881 1
One of the most powerful and popular tools used in combinatorics is the probabilistic method. Describes current algorithmic techniques, applying both the classical method and the modern tools it uses. Along with a detailed description of the techniques used in probabilistic arguments, it includes basic methods which utilize expectation and variance plus recent applications of martingales and correlation inequalities. Examines discrepancy and random graphs and covers such topics as theoretical computer science, computational geometry, derandomization of randomized algorithms and more. A study of various topics using successful probabilistic techniques is included along with an Open Problems Appendix by Paul Erd?s, the founder of the probabilistic method.

Customers Who Bought This Item Also Bought


Editorial Reviews

Review

"...an exciting well-written book which will give much enjoyment to a reader..." (Mathematical Reviews, 2003f) --This text refers to an out of print or unavailable edition of this title.

From the Publisher

One of the most powerful and popular tools used in combinatorics is the probabilistic method. Describes current algorithmic techniques, applying both the classical method and the modern tools it uses. Along with a detailed description of the techniques used in probabilistic arguments, it includes basic methods which utilize expectation and variance plus recent applications of martingales and correlation inequalities. Examines discrepancy and random graphs and covers such topics as theoretical computer science, computational geometry, derandomization of randomized algorithms and more. A study of various topics using successful probabilistic techniques is included along with an Open Problems Appendix by Paul Erdos, the founder of the probabilistic method.

Product Details

  • Hardcover: 272 pages
  • Publisher: Wiley-Interscience; 1 edition (November 1, 1991)
  • Language: English
  • ISBN-10: 0471535885
  • ISBN-13: 978-0471535881
  • Product Dimensions: 9.1 x 6.6 x 1.1 inches
  • Shipping Weight: 1.6 pounds
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Best Sellers Rank: #4,226,857 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

4 Reviews
5 star:
 (4)
4 star:    (0)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
5.0 out of 5 stars (4 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

29 of 31 people found the following review helpful:
5.0 out of 5 stars Learn from the masters, July 3, 2001
By 
Wonk "yeager" (Philadelphia, PA USA) - See all my reviews
This book shows you how to approach problems in discrete mathematics that don't seem to be probabilistic at all, and nonetheless to apply probabilistic methods to find extremely sharp results. The book is full of beautifully chosen examples worked out by the authors, who are world class researchers in this subject area. Should be on the bookshelf of everyone who uses discrete mathematics.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


17 of 19 people found the following review helpful:
5.0 out of 5 stars A very interesting book, September 14, 2000
By 
Todd Ebert (Long Beach California) - See all my reviews
I found this book very enjoyable to read. Although the underlying theme of the book is to demonstrate examples of proofs of existence of a property of a finite structure by showing the structure must have the property with positive probabiltiy, the book goes beyond this to cover areas such as circuit complexity and discrepancy theory that rely heavily on probabilistic arguments. A must read for anyone who wants to add probablistic tools to their toolbox for proving things about discrete structures.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


13 of 15 people found the following review helpful:
5.0 out of 5 stars Love, love, love this book..., September 8, 2005
I happen to love studying probability theory and the probabilistic method and this is the book I come to time and time again. It is well organized and provides great, straightforward, insightful explanations. However, its main strength is its wealth of beautiful (fairly recently) results (in varied fields) which show the method coming to life. Can't recommend this enough...
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews


Only search this product's reviews



Inside This Book (learn more)
Browse and search another edition of this book.
First Sentence:
The probabilistic method is a powerful tool for tackling many problems in discrete mathematics. Read the first page
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Chebyschev's Inequality, Talagrand's Inequality, Zero-One Law, Azuma's Inequality, Janson's Inequality, Coding Scheme, Kim-Vu Polynomial Concentration, Poisson Paradigm, First Pass, Shannon's Theorem, Crossing Numbers
New!
Books on Related Topics
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:



Books on Related Topics (learn more)

What Other Items Do Customers Buy After Viewing This Item?


Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums





Look for Similar Items by Category


Look for Similar Items by Subject