The probabilistic method has undergone intensive development in the wake of the increasing significance of randomness in theoretical computer science. This text features detailed descriptions of algorithmic techniques combined with a study of the classical method and the modern tools commonly applie
The probabilistic method in combinatorics
β Scribed by Alon N., Spencer J.H.
- Publisher
- Wiley
- Year
- 2000
- Tongue
- English
- Leaves
- 319
- Edition
- 2
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
Probabilistic modeling and analysis of spatial telecommunication systems have never been more important than they are today. In particular, it is an essential research area for designing and developing next-generation communication networks that are based on multihop message transmission technology.
Probabilistic methods have become a vital tool in the arsenal of every combinatorialist. The theory of random graphs is still a prime area for the use of probabilistic methods, and, over the years, these methods have also proved of paramount importance in many associated areas such as the design