Summary: 1
1
Courtesy RK Brayton (UCB)
and A Kuehlmann
(Cadence)
Binary
Dec ision Diagrams:
eory an m emen a ion
2
Representing Boolean functions
. Fundamental trade­off
-- canonical data structures
. data structure uniquely represents function
. Tautology decision procedure is trivial (e.g., just pointer
comparison)
. example: truth tables, Binary Decision Diagrams
. size of data structure is in general exponential
-- noncanonical data structures
. covers, POS, formulas, logic circuits
. systematic search for satisfying assignment

Source: Aziz, Adnan - Department of Electrical and Computer Engineering, University of Texas at Austin

Collections: Computer Technologies and Information Sciences