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 Boolean functions include negation normal form (NNF), Zhegalkin polynomials, and propositional directed acyclic graphs (PDAG).
Wikipage disambiguates
And-inverter graphAutomated theorem provingBDDBernoulli distributionBinary Decision DiagramBinary Decision DiagramsBinary decisionBinary decision diagramsBinary moment diagramBoole's expansion theoremBoolean algebraBoolean functionBoolean satisfiability problemBranching programBranching programsChristoph MeinelCommunicating sequential processesComputer engineering compendiumConfigure, price and quoteDPLL algorithmDatalogDecision tree learningDigital electronicsDirected acyclic graphEdmund M. ClarkeEnumeration algorithmFormal equivalence checkingFormal methodsHomomorphic encryptionIngo WegenerKarnaugh mapKevin KarplusKnowledge compilationL/polyL (complexity)LibdmcList of PSPACE-complete problemsList of data structuresList of graphical methodsList of terms relating to algorithms and data structures
Link from a Wikipage to another Wikipage
seeAlso
differentFrom
primaryTopic
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 Boolean functions include negation normal form (NNF), Zhegalkin polynomials, and propositional directed acyclic graphs (PDAG).
has abstract
En ciencias de la computación, ...... necesidad de descomprimirlos.
@es
En informatique, un graphe de ...... el checking symbolique de CTL.
@fr
En les ciències de la computac ...... ecessitat de descomprimir-los.
@ca
In computer science, a binary ...... irected acyclic graphs (PDAG).
@en
In de informatica is een binai ...... ie gerepresenteerd kan worden.
@nl
Бинарная диаграмма решений (БД ...... programs (BP) соответственно.
@ru
Бінарна діаграма рішень (англ. ...... аперечення нормальної форми, .
@uk
二分決定図（にぶんけっていず、Binary Decision ...... 分木のような構造であることから）二分決定木と呼ぶこともある。
@ja
在计算机科学中，二元决策图（英語：binary decision diagram, BDD），或译为二元判定图，是被用来表达一个布尔函数的一种数据结构。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,927,196
Link from a Wikipage to another Wikipage
cs1-dates
y
@en
date
May 2019
@en
wikiPageUsesTemplate
hypernym
comment
En ciencias de la computación, ...... necesidad de descomprimirlos.
@es
En informatique, un graphe de ...... manière compacte / compressée.
@fr
En les ciències de la computac ...... ecessitat de descomprimir-los.
@ca
In computer science, a binary ...... irected acyclic graphs (PDAG).
@en
In de informatica is een binai ...... ie gerepresenteerd kan worden.
@nl
Бинарная диаграмма решений (БД ...... programs (BP) соответственно.
@ru
Бінарна діаграма рішень (англ. ...... аперечення нормальної форми, .
@uk
二分決定図（にぶんけっていず、Binary Decision ...... 分木のような構造であることから）二分決定木と呼ぶこともある。
@ja
在计算机科学中，二元决策图（英語：binary decision diagram, BDD），或译为二元判定图，是被用来表达一个布尔函数的一种数据结构。
@zh
label
Binair beslissingsdiagram
@nl
Binary decision diagram
@en
Binäres Entscheidungsdiagramm
@de
Diagrama de decisió binari
@ca
Diagrama de decisión binario
@es
Diagramme de décision binaire
@fr
Бинарная диаграмма решений
@ru
Бінарна діаграма рішень
@uk
二元决策图
@zh
二分決定図
@ja