Sign inSign in

Sherali-Adams proof system (SA(k)SA(k))

A proof system for polynomial inequalities on 00-11 variables based on axioms that are true polynomial statements on kk out of nn 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.

Boolean variables1Polynomial inequalities1

Opens up

Concepts that name this one as a prerequisite.

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.