Editing Binary decision diagram (section)

{{Short description|Data structure for Boolean functions}}
{{Use dmy dates|date=May 2019|cs1-dates=y}}
{{Redirect|Branching program||NC (complexity)#Barrington's theorem}}
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 [[data compression|compressed]] representation of [[set (mathematics)|sets]] or [[relation (mathematics)|relation]]s. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression.

Similar [[data structure]]s include [[negation normal form]] (NNF), [[Zhegalkin polynomial]]s, and [[propositional directed acyclic graph]]s (PDAG).