The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions
Issue No. 11 - November (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.324559
<p> Boolean functions are often represented by ordered binary-decision diagrams (OBDDs) introduced by Bryant (1986). Liaw and Lin (1992) have proved upper and lower bounds on the minimal OBDD size of almost all Boolean functions. Now tight bounds are proved for the minimal OBDD size for arbitrary or optimal variable orderings and for the minimal read-once branching program size of almost all functions. Almost all Boolean functions have a sensitivity of almost 1, i.e., the minimal OBDD size for an optimal variable ordering differs from the minimal OBDD size for a worst variable ordering by a factor of at most 1+/spl epsi/(n) where /spl epsi/(n) converges exponentially fast to 0.</p>
Boolean functions; directed graphs; computational complexity; programming theory; optimal read-once branching programs; Boolean functions; ordered binary-decision diagrams; minimal read-once branching program size; reduction rules; size complexity; variable ordering.
I. Wegener, "The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions", IEEE Transactions on Computers, vol. 43, no. , pp. 1262-1269, November 1994, doi:10.1109/12.324559