Issue No.03 - March (1994 vol.43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.272442
<p>Chakravarty presents a characterization of BDD's in terms of the complexity of some computational problems. In these comments, some incorrectly stated restrictions on the "number of repeated variables" are corrected and results on the translation problem (to include EXOR and NEXOR gates) are generalized.</p>
decision tables; computational complexity; combinatorial circuits; Boolean functions; binary decision diagrams; complexity; EXOR gates; NEXOR gates; free BDDs; ordered BDDs; repeated BDDs.
I. Wegener, "Comments on "A Characterization of Binary Decision Diagrams"", IEEE Transactions on Computers, vol.43, no. 3, pp. 383-384, March 1994, doi:10.1109/12.272442