Sign inSign in

Sherali-Adams proof system

A degree-k proof system using multilinear polynomial inequalities over 0-1 variables with non-negative linear combination rules and axioms for true inequalities on up to k variables.
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.

Axiom1Axiom systems1Boolean variables1Linear programming relaxation1LP relaxation1Polynomial inequalities1Primal graph1

Lecturers

1

    Connections

    4

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

    Concepts3

    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.