ConceptTheory & Algos
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.
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
1Connections
4The lectures that define it or assume it, and the concepts next to it.