Pseudoexpectations || @ CMU || Lecture 21(d) of CS Theory Toolkit @RyanODonnellTeaching
Pseudoexpectations || @ CMU || Lecture 21(d) of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 1 hour ago
The dual of the Sherali--Adams and SOS proof systems involve "pseudoexpectations": 'fake' probability distributions on the Boolean cube. Lecture 21(d) 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/)
Pseudoexpectations || @ CMU || Lecture 21(d) of CS Theory Toolkit#4/100: What is a qubit?  || Quantum Computer Programming in 100 Easy Lessons#86/100: Rotation Estimation gives clues about L || Quantum Computer Programming in 100 Easy LessonsTrees and Series-Parallel Graphs || @ CMU || Lecture 22a of CS Theory ToolkitImpagliazzo Wigderson, and Nisans PRGs || @ CMU || Lecture 12b of CS Theory Toolkit#52/100: Reflecting through a vector || Quantum Computer Programming in 100 Easy Lessons#2/100: Mystery Toggles || Quantum Computer Programming in 100 Easy LessonsDinurs PCP: degree-reduction, expanderizing, mini-PCP || @ CMU || Lecture 27c of CS Theory Toolkit#73/100: Quantum teleportation: Part 1 || Quantum Computer Programming in 100 Easy LessonsInequalities, asymptotics, primes || @ CMU || Homework 1 / Recitation 2 of CS Theory ToolkitETH False#62/100: 1-qubit Rotation Estimation to factor 2 || Quantum Computer Programming in 100 Easy Lessons
Ryan ODonnell |

Pseudoexpectations || @ CMU || Lecture 21(d) of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER