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:
“How could a man be satisfied with a decision between such alternatives and under such circumstances? No more than he can be satisfied with his hat, which he’s chosen from among such shapes as the resources of the age offer him, wearing it at best with a resignation which is chiefly supported by comparison.”
—George Eliot [Mary Ann (or Marian)
“If a fish is the movement of water embodied, given shape, then cat is a diagram and pattern of subtle air.”
—Doris Lessing (b. 1919)