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 women of my mother’s generation had, in the main, only one decision to make about their lives: who they would marry. From that, so much else followed: where they would live, in what sort of conditions, whether they would be happy or sad or, so often, a bit of both. There were roles and there were rules.”
—Anna Quindlen (20th century)
“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)