Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis读书介绍
类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
---|---|---|---|---|---|
书籍 | 484页 | 2020 | Cambridge University Press |
定价 | 出版日期 | 最近访问 | 访问指数 |
---|---|---|---|
USD 62.23 | 2020-02-20 … | 2020-03-07 … | 76 |
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.
作者简介Review
'As randomized methods continue to grow in importance, this textbook provides a rigorous yet accessible introduction to fundamental concepts that need to be widely known. The new chapters in this second edition, about sample size and power laws, make it especially valuable for today's applications.' Donald E. Knuth, Stanford University'Of all the courses I have taught a...
剧情呢,免费看分享剧情、挑选影视作品、精选好书简介分享。