Issue No.11 - November (2000 vol.49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.895944
<p><b>Abstract</b>—In this paper, a slight error in the paper of Bryant [<ref type="bib" rid="bibT12901">1</ref>] is corrected. It was stated in [<ref type="bib" rid="bibT12901">1</ref>] 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.</p>
Boolean function, Binary Decision Diagram, composition.
Elena Dubrova, "A Comment on 'Graph-Based Algorithm for Boolean Function Manipulation'", IEEE Transactions on Computers, vol.49, no. 11, pp. 1290-1292, November 2000, doi:10.1109/12.895944