This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on "A Characterization of Binary Decision Diagrams"
March 1994 (vol. 43 no. 3)
pp. 383-384

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.

[1] R. E. Bryant, "Graph-based algorithms for Boolean function manipulation,"IEEE Trans. Comput., vol. C-35, no. 8, pp. 677-691, Aug. 1986.
[2] S. Chakravarty, "A characterization of binary decision diagrams,"IEEE Trans. Comput., vol. 42, pp. 129-137, Feb. 1993.

Index Terms:
decision tables; computational complexity; combinatorial circuits; Boolean functions; binary decision diagrams; complexity; EXOR gates; NEXOR gates; free BDDs; ordered BDDs; repeated BDDs.
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.