Proof complexity of positive branching programs

Anupam Das, Avgerinos Delkos

We investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes,…