everything.study
COMP 585

PROBABILISTIC TOOLKIT FOR LEARNING AND COMPUTING

Credit Hours: 3 · Graduate

Randomness is one of the strongest tools which enables designing efficient algorithms. The applications of randomness in computer science spans machine learning algorithm, cryptography, networks, distributed systems. In this course, we study a variety of probabilistic tools and techniques that allow us to harness the power of randomness and apply it in algorithm design and learning theory. Recommended Prerequisite(s): COMP 382

Prerequisites & course information

Short Title: PROB TOOLKIT FOR LEARNING & CO Department: Computer Science Grade Mode: Standard Letter Course Type: Lecture Credit Hours: 3 Restrictions: Enrollment is limited to Graduate level students. Course Level: Graduate

Sources