Nathan Segerlind On the relative efficiency of resolution-like proofs and ordered binary decision diagram proofs. 2007 14 Electronic Colloquium on Computational Complexity (ECCC) http://eccc.hpi-web.de/eccc-reports/2007/TR07-126/index.html 126 db/journals/eccc/eccc14.html#Segerlind07a