1 citations · 2 across the 2 of their papers we have counts for
3 papers
Depth lower bounds in Stabbing Planes for combinatorial principles
Stefan Dantchev, Nicola Galesi, Abdul Ghani +1
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 inequal…
Proof complexity and the binary encoding of combinatorial principles
Stefan Dantchev, Nicola Galesi, Abdul Ghani +1
We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in severa…
Sherali-Adams and the binary encoding of combinatorial principles
Stefan Dantchev, Abdul Ghani, Barnaby Martin
We consider the Sherali-Adams (SA) refutation system together with the unusual binary encoding of certain combinatorial principles. For the unary encoding of the Pigeonhole Princip…