Linear Sifting of Decision Diagrams yChristoph

We propose a new algorithm, called linear sifting, for the optimization of decision diagrams that combines the ee-ciency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples , and that in many cases it leads to substantially more compact diagrams when compared to simple variable reordering. We show in what sense linear transformations complement variable reordering, and we discuss applications of the new technique to synthesis and veriication.