
Depth lower bounds in Stabbing Planes for combinatorial principles
We prove logarithmic depth lower bounds in Stabbing Planes for the class...
read it

Counting and localizing defective nodes by Boolean network tomography
Identifying defective items in larger sets is a main problem with many a...
read it

Proof complexity and the binary encoding of combinatorial principles
We consider Proof Complexity in light of the unusual binary encoding of ...
read it

VertexConnectivity Measures for Node Failure Identification in Boolean Network Tomography
We investigate three questions in Boolean Network Tomography, related to...
read it

Resolution and the binary encoding of combinatorial principles
We investigate the size complexity of proofs in Res(s)  an extension o...
read it

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
We study maximal identifiability, a measure recently introduced in Boole...
read it
Nicola Galesi
is this you? claim profile