Probability and computing: an introduction to randomized algorithms and probabilistic analysis
Book information
Description
Assuming only an elementary background in discrete mathematics, this textbook is an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales, entropy, and other topics. The book is designed to accompany a one- or two-semester course for graduate students in computer science and applied mathematics.
Similar books
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
2017 · PDF
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
2017 · PDF
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
2017 · PDF
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2nd Edition
2017 · PDF
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
2017 · PDF
Probability and Computing
2017 · PDF
Probability and computing: an introduction to randomized algorithms and probabilistic analysis
2005 · DJVU
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
2005 · PDF