The probabilistic method
Author(s)
Bibliographic Information
The probabilistic method
（Wiley-Interscience series in discrete mathematics and optimization）
Wiley, c1992
Available at / 53 libraries
-
The University of Electro-Communications Library研
412.2/412219200619,2219204610,2219402373,2219409365,2219607743,2219707349
-
No Libraries matched.
- Remove all filters.
Note
"A Wiley-Interscience publication."
Includes bibliographical references (p. 245-250) and index
Description and Table of Contents
Description
This a a guide to the probabilistic method, an extremely powerful tool for solving complex problems in discrete mathematics which is recognized as a primary methodology in theoretical computer science. Improved techniques and classical methods are discussed, with applications to discrete maths, theoretical computer science, circuit complexity, coding theory and computational geometry. The book also presents the probabilistic method in action and provides a section giving new insights into already known theorems and results.
Table of Contents
METHODS. The Basic Method. Linearity of Expectation. Alterations. The Second Moment. The Local Lemma. Correlation Inequalities. Martingales. The Poisson Paradigm. Pseudo-Randomness. TOPICS. Random Graphs. Circuit Complexity. Discrepancy. Geometry. Codes and Games. Derandomization. Appendices. References. Index.
by "Nielsen BookData"