Binary decision diagram

BDD for the function ƒ(x1, ..., x8) = x1x2 + x3x4 + x5x6 + x7x8 using bad variable ordering

In computer science, a binary decision diagram (BDD) or branching program 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. Other data structures used to represent a Boolean function include negation normal form (NNF), and propositional directed acyclic graph (PDAG).

单词	Reduced ordered binary decision diagram
释义	Reduced ordered binary decision diagram 英语百科 Binary decision diagram In computer science, a binary decision diagram (BDD) or branching program 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. Other data structures used to represent a Boolean function include negation normal form (NNF), and propositional directed acyclic graph (PDAG).
随便看	Rhodialothan Rhodian Rhodian Law rhodian laws Rhodian school Rhodian Sea Law Rhodiascit Rhodiatox rhodic rhodic ferralsol rhodic ferralsols Rhodichthyini rhodic nevyanskite rhodic platinum Rhodie Rhodie bar Rhodie bars rhodiene Rhodies Rhodiglobin rhodilunacin rhodime Rhod immune globulin Rhodin rhodina grease

Reduced ordered binary decision diagram

Binary decision diagram