This is a preview. Log in through your library . Abstract We prove an exponential lower bound on the size of proofs in the proof system operating with ordered binary decision diagrams introduced by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback