Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
Shin-ichi Minato, Nagisa Ishiura, Shuzo Yajima · 1990
The efficiency of Boolean function manipulation depends on the form of representation of Boolean functions. Binary Decision Diagrams (BDD's) are graph representations proposed by Akers and Bryant. BDD's have some properties which can be used to enable efficient Boolean function manipulation.