Title :
On the OBDD-representation of general Boolean functions
Author :
Liaw, Heh-Tyan ; Lin, Chen-Shang
Author_Institution :
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fDate :
6/1/1992 12:00:00 AM
Abstract :
The behavior of ordered binary decision diagrams (OBDD) for general Boolean functions is studied. A tight upper bound of (2n /n)(2+ε) for the worst case OBDD size is derived. Although the size of an OBDD is dependent on the ordering of decision variables, it is shown that almost all functions are not sensitive to variable ordering
Keywords :
Boolean functions; computational complexity; general Boolean functions; ordered binary decision diagrams; tight upper bound; Artificial intelligence; Boolean functions; Councils; Data structures; Logic design; Logic testing; Merging; Upper bound;
Journal_Title :
Computers, IEEE Transactions on
