Explore Constraint Satisfaction Problems (CSPs) in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Delve into formal definitions, the Dichotomy Conjecture (now Theorem), and its significance in theoretical computer science. Learn about CSP examples, algorithms, and satisfiability. Gain insights from additional resources on CSP approximability and polymorphisms. Taught by Ryan O'Donnell, this 32-minute video offers a comprehensive look at fundamental concepts essential for research in theoretical computer science.
Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit
Overview
Syllabus
Introduction
Constraint Satisfaction Problems
Formal Definition
Examples
CSPs
Algorithms
Satisfiability
Taught by
Ryan O'Donnell
Related Courses
-
When and How are Promise Constraint Satisfaction Problems Efficiently Solvable
-
Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit
-
The Complexity of Satisfiable CSPs
-
Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems
-
Trees and Series-Parallel Graphs - Lecture 22a of CS Theory Toolkit
-
Hard and Easy Constraint Problems - ICBS 2024
