CSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit @RyanODonnellTeaching
CSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 3 hours ago
CSP (constraint satisfaction problem) optimization (trying to find good solutions) and certification (trying to find upper bounds on the value of the best solution). Also discussed: some of the best known algorithmic approximability and NP-hardness results, including the 2-to-2 Theorem. Lecture 20c of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Resources for this lecture:
Approximability of CSPs: http://www.cs.cmu.edu/~odonnell/slides/csp-approx.pdf
"Polymorphisms, and how to use them" by Barto, Krokhin, and Willard (for the Dichotomy Conjecture/Theorem. This survey was written *just* before the Algebraic Dichotomy Conjecture was proven.)

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/

Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
CSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit#32/100: Correlation of Boolean functions || Quantum Computer Programming in 100 Easy LessonsRandom Reversible Circuits || For Tim Gowerss 60th Birthday WorkshopSpectral Graph Theory: eigenvalues || @ CMU || Lecture 15a of CS Theory Toolkit#78/100: Classical win probability of CHSH is 75% | Quantum Computer Programming in 100 Easy LessonsEpsilon-biased Generators || @ CMU || Lecture 12d of CS Theory ToolkitLayer cakes and slivers || @ CMU || Recitation 3 of CS Theory Toolkit#60/100: 1-qubit Rotation Estimation: Overview || Quantum Computer Programming in 100 Easy Lessons#59/100: Grover when you know p to within 1% || Quantum Computer Programming in 100 Easy Lessons#95/100: Rotation Estimation in superposition: 1 || Quantum Computer Programming in 100 Easy Lessons#77/100: The CHSH Game || Quantum Computer Programming in 100 Easy LessonsLinear Programming: Definitions || @ CMU || Lecture 17a of CS Theory Toolkit
Ryan ODonnell |

CSP Approximability: Optimization and Certification || @ CMU || Lecture 20c of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER