Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Publisher:Cambridge University | Pages: 368 | 2005-01-31| ISBN 0521835402| DJVU | 2 MB
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.
Thanks to original uploader
Free mirror provided - so Follow the rules - No More Mirrors
related link：
-
Elementary Background Chernoff Bounds Free Mirror Random Sampling Probabilistic Techniques Discrete Mathematics Probabilistic Algorithms Probabilistic Method Probabilistic Analysis Cambridge University Djvu Semester Course Entropy Paradigms Inequalities G
- More infomation may be in the description section, read description carefully!
- Click "Ebook Search" button to find mirrors if no download links or dead links in the description.