W ch14
On the Relation between SAT and BDDs for Equivalence Checking Sherief Reda Rolf Drechsler Alex Orailoglu Computer Science & Engineering Dept. University.
Lecture 2: Reasoning with Distributed Programs Anish Arora CSE 6333.
Optimal Polynomial Time Algorithms for Register Assignment Presented at the Chinese University of Hong Kong - Fernando M. Q. Pereira - August 28 th, 2007.
On the Relation between SAT and BDDs for Equivalence Checking
