In the field of computer science, a binary decision diagram (BDD) or branching program, like a negation normal form (NNF) or a propositional directed acyclic graph (PDAG), is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered as a compressed representation of sets or relations. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression.
Read more about Binary Decision Diagram: Definition, History, Applications, Variable Ordering, Logical Operations On BDDs
Famous quotes containing the words decision and/or diagram:
“The decision to have a child is both a private and a public decision, for children are our collective future.”
—Sylvia Ann Hewitt (20th century)
“Gods fire upon the wane,
A diagram hung there instead,
More women born than men.”
—William Butler Yeats (18651939)