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

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