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 impulse to perfection cannot exist where the definition of perfection is the arbitrary decision of authority. That which is born in loneliness and from the heart cannot be defended against the judgment of a committee of sycophants. The volatile essences which make literature cannot survive the clichés of a long series of story conferences.”
—Raymond Chandler (1888–1959)
““God’s fire upon the wane,
A diagram hung there instead,
More women born than men.””
—William Butler Yeats (1865–1939)