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:
“Our decision about energy will test the character of the American people and the ability of the President and the Congress to govern this nation. This difficult effort will be the “moral equivalent of war,” except that we will be uniting our efforts to build and not to destroy.”
—Jimmy Carter (James Earl Carter, Jr.)
“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)