Sign inSign in

Cutting planes proof system

A proof system that extends the linear programming proof system by adding an inference rule allowing one to round down the right-hand side of a linear inequality if all left-hand side coefficients are integers and the right-hand side is not an integer.
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.

Lecturers

1

    Connections

    3

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

    Concepts2

    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.