We prove logarithmic depth lower bounds in Stabbing Planes for the class...
We consider Proof Complexity in light of the unusual binary encoding of
...
We consider the Sherali-Adams (SA) refutation system together with the
u...
We investigate the size complexity of proofs in Res(s) -- an extension o...
share