Sign inSign in

Sum-of-squares (SOS) SDP hierarchy

An algorithmic framework that can be proven not to solve random 3-Sat or random k-Sat in less than a certain sub-exponential time.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Hierarchy of relaxations1Semidefinite programming1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.