By Topic

On the OBDD-representation of general Boolean functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Heh-Tyan Liaw ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Chen-Shang Lin

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

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 6 )