Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
Product Description
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
Greatly expanded, this new edition requires only an elementary background in discrete mathematics and offers a comprehensive introduction to the role of randomization and probabilistic techniques in modern computer science. Newly added chapters and sections cover topics including normal distributions, sample complexity, VC dimension, Rademacher complexity, power laws and related distributions, cuckoo hashing, and the Lovasz Local Lemma. Material relevant to machine learning and big data analysis enables students to learn modern techniques and applications. Among the many new exercises and examples are programming-related exercises that provide students with excellent training in solving relevant problems. This book provides an indispensable teaching tool to accompany a one- or two-semester course for advanced undergraduate students in computer science and applied mathematics.
Technical Specifications
You might also like
Randomized Algorithms
High-Dimensional Statistics: A Non-Asymptotic Viewpoint (Cambridge Series in Statistical and Probabilistic Mathematics)
Linear Algebra and Learning from Data
Reinforcement Learning: An Introduction (Adaptive Computation and Machine Learning series)
High-Dimensional Probability: An Introduction with Applications in Data Science (Cambridge Series in Statistical and Probabilistic Mathematics)
Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
The Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization)
Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures (Volume 2)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Machine Learning: A Probabilistic Perspective (Adaptive Computation and Machine Learning series)