Proof Complexity for CSPs || @ CMU || Lecture 21a of CS Theory Toolkit @RyanODonnellTeaching
Proof Complexity for CSPs || @ CMU || Lecture 21a of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 2 hours ago
Trying to find an upper bound for the maximum value of a certain constraint satisfaction problem? This is a job for proof complexity! Beginning the Sherali--Adams and Sum-of-Squares proof systems. Lecture 21a 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.

Resource for this lecture:
"Semialgebraic Proofs and Efficient Algorithm Design" by Noah Fleming, Pravesh Kothari, and Toniann Pitassi

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/)
Proof Complexity for CSPs || @ CMU || Lecture 21a of CS Theory Toolkit#53/100: SAT || Quantum Computer Programming in 100 Easy Lessons#21/100: CCode → QCode, If f then Minus spec || Quantum Computer Programming in 100 Easy Lessons#76/100: How Alice & Bob mutually rotate |EPR〉|| Quantum Computer Programming in 100 Easy LessonsThe secret GCD method they didnt teach you in school.#10/100: Probability trees || Quantum Computer Programming in 100 Easy Lessons#20/100: Quantum Programming Paradigm 1 || Quantum Computer Programming in 100 Easy Lessons#74/100: Quantum teleportation: Part 2 || Quantum Computer Programming in 100 Easy Lessons#89/100: One Steering Wheel vector for IncrL || Quantum Computer Programming in 100 Easy Lessons#97½/100: Final Prize Pantry (no quantum) || Quantum Computer Programming in 100 Easy LessonsA non-sofic group#33/100: Hadamard transform: how it works || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Proof Complexity for CSPs || @ CMU || Lecture 21a of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER