On the complexity and optimization of branching programs for decision diagram machines


Decision Diagram Machines (DDMs) are special purpo se processors that evaluate decision diagrams. First, this paper derives upper bounds on the cost of multi-terminal binary decision diagram s (MTBDDs) for multiple-output logic functions. From these bounds we can estimate the size of branching programs running on various DDMs. Second, optimizat ion of… (More)
DOI: 10.3182/20120523-3-CZ-3015.00020