COSC 49.10 Randomized Algorithms

Randomness is one of the key resources in algorithm design. Many problems have faster algorithms if randomization is allowed, and indeed, for certain problems randomness is essential. The course will introduce the probability basics, the fundamental tools, and provide multiple applications in machine learning, big data, optimization, etc.

Prerequisite

COSC 30 and COSC 31. Recommended Preparation: Experience with reading and writing mathematical proofs.

Degree Requirement Attributes

Dist:TAS

The Courses@Dartmouth contains the most up-to-date information about a course. It includes not only the meeting time and instructor, but also its official distributive and/or world culture designation. This information supersedes any information you may see elsewhere, to include what may appear in this ORC/Catalog or on a department/program website. Note that course attributes may change term to term therefore those in effect are those (only) during the term in which you enroll in the course.