Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems

Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems

Explore constraint satisfaction problems in this 75-minute graduate-level lecture from Carnegie Mellon University's course on Analysis of Boolean Functions. Delve into topics such as generic CSP, Max3sat, Max3coloring, CSP linearity tests, approximation algorithms, and the PCP theorem. Gain insights from Professor Ryan O'Donnell's expertise and benefit from references to the free textbook and course website for further study.