Nathan Segerlind On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs. 100-111 2008 IEEE Conference on Computational Complexity http://doi.ieeecomputersociety.org/10.1109/CCC.2008.34 conf/coco/2008 db/conf/coco/coco2008.html#Segerlind08