|
|
|
|
| LEADER |
02681nmm a2200385 u 4500 |
| 001 |
EB000690858 |
| 003 |
EBX01000000000000000543940 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783662127889
|
| 100 |
1 |
|
|a Habib, Michel
|e [editor]
|
| 245 |
0 |
0 |
|a Probabilistic Methods for Algorithmic Discrete Mathematics
|h Elektronische Ressource
|c edited by Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed
|
| 250 |
|
|
|a 1st ed. 1998
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1998, 1998
|
| 300 |
|
|
|a XVII, 325 p
|b online resource
|
| 505 |
0 |
|
|a The Probabilistic Method -- Probabilistic Analysis of Algorithms -- An Overview of Randomized Algorithms -- Mathematical Foundations of the Markov Chain Monte Carlo Method -- Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems -- Concentration -- Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms -- Author Index
|
| 653 |
|
|
|a Symbolic and Algebraic Manipulation
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Probability Theory
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Probabilities
|
| 700 |
1 |
|
|a McDiarmid, Colin
|e [editor]
|
| 700 |
1 |
|
|a Ramirez-Alfonsin, Jorge
|e [editor]
|
| 700 |
1 |
|
|a Reed, Bruce
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Algorithms and Combinatorics
|
| 028 |
5 |
0 |
|a 10.1007/978-3-662-12788-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-662-12788-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.1
|
| 520 |
|
|
|a The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications - an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms - a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods) - a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph - a succinct treatment of randomized algorithms and derandomization techniques
|