2009 International Conference on Future Computer and Communication 2009
DOI: 10.1109/icfcc.2009.31
|View full text |Cite
|
Sign up to set email alerts
|

Binary Decision Diagram (BDD)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Binary Decision Trees [38] is an acyclic graph used to represent a Boolean function. It is a data structure that consist of a decision node that labels the Boolean variable and possesses two child nodes that correspond to each variable state.…”
Section: Methodsmentioning
confidence: 99%
“…Binary Decision Trees [38] is an acyclic graph used to represent a Boolean function. It is a data structure that consist of a decision node that labels the Boolean variable and possesses two child nodes that correspond to each variable state.…”
Section: Methodsmentioning
confidence: 99%