Issue No. 06 - June (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.144618
<p>The behavior of ordered binary decision diagrams (OBDD) for general Boolean functions is studied. A tight upper bound of (2/sup n//n)(2+ epsilon ) 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.</p>
general Boolean functions; ordered binary decision diagrams; tight upper bound; Boolean functions; computational complexity.
H. Liaw and C. Lin, "On the OBDD-Representation of General Boolean Functions," in IEEE Transactions on Computers, vol. 41, no. , pp. 661-664, 1992.