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/)
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/)










