DocumentCode
1037174
Title
Comments on "A characterization of binary decision diagrams"
Author
Wegener, Ingo
Author_Institution
Fachbereich Inf., Dortmund Univ., Germany
Volume
43
Issue
3
fYear
1994
fDate
3/1/1994 12:00:00 AM
Firstpage
383
Lastpage
384
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;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.272442
Filename
272442
Link To Document