no code implementations • 15 Feb 2021 • Stefan Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
Stabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequalities instead of single variables.
Computational Complexity
no code implementations • 17 Dec 2020 • Barnaby Martin, Daniël Paulusma, Siani Smith
A graph class is hereditary if it is closed under vertex deletion.
Computational Complexity
