By Topic

A comment on "Graph-based algorithm for Boolean function manipulation"

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)
Dubrova, E. ; Dept. of Electron., R. Inst. of Technol., Stockholm, Sweden ; Macchiarulo, L.

In this paper, a slight error in the paper of Bryant (ibid., vol.35, no.8, p.677-691, Aug. 1986 is corrected: It was stated that, under a certain ordering restriction, composition of two Reduced Ordered Binary Decision Diagrams (ROBDDs) results in a reduced OBDD. We show a counterexample and explore under which conditions this statement is incorrect.

Published in:

Computers, IEEE Transactions on  (Volume:49 ,  Issue: 11 )