Title :
Comments on "A characterization of binary decision diagrams"
Author_Institution :
Fachbereich Inf., Dortmund Univ., Germany
fDate :
3/1/1994 12:00:00 AM
Abstract :
Chakravarty presents a characterization of BDD\´s in terms of the complexity of some computational problems, ibid., vol. 42, p. 129-137, Feb. 1993. 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.<>
Keywords :
Boolean functions; combinatorial circuits; computational complexity; decision tables; EXOR gates; NEXOR gates; binary decision diagrams; complexity; free BDDs; ordered BDDs; repeated BDDs; Binary decision diagrams; Binary trees; Boolean functions; Circuits; Data structures; Polynomials; Upper bound;
Journal_Title :
Computers, IEEE Transactions on
