Comments on "A Characterization of Binary Decision Diagrams"

Authors:
I. Wegener
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1994

Citing 2
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A Characterization of Binary Decision Diagrams

IEEE Transactions on Computers

On Variable Ordering and Decomposition Type Choice in OKFDDs

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.