2 citations · 4 across the 5 of their papers we have counts for
7 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…
Resolution and the binary encoding of combinatorial principles
Stefan Dantchev, Nicola Galesi, Barnaby Martin
We investigate the size complexity of proofs in -- an extension of Resolution working on -DNFs instead of clauses -- for families of contradictions given in the {\em un…
Simplicial Complex Entropy
Stefan Dantchev, Ioannis Ivrissimtzis
We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices be…
Relativisation makes contradictions harder for Resolution
Stefan Dantchev, Barnaby Martin
We provide a number of simplified and improved separations between pairs of Resolution-with-bounded-conjunction refutation systems, Res(d), as well as their tree-like versions, Res…
Parameterized Resolution with bounded conjunction
Stefan Dantchev, Barnaby Martin
We provide separations between the parameterized versions of Res(1) (Resolution) and Res(2). Using a different set of parameterized contradictions, we also separate the parameteriz…