Editing Binary decision diagram (section)

== See also ==
* [[Boolean satisfiability problem]], the canonical [[NP-complete]] [[computational problem]]
* [[L/poly]], a [[complexity class]] that strictly contains the set of problems with polynomially sized BDDs{{Citation needed|date=February 2020}}
* [[Model checking]]
* [[Radix tree]]
* [[NC (complexity)#Barrington's theorem|Barrington's theorem]]
* [[Hardware acceleration]]
* [[Karnaugh map]], a method of simplifying Boolean algebra expressions
* [[Zero-suppressed decision diagram]]
* [[Algebraic decision diagram]], a generalization of BDDs from two-element to arbitrary finite sets
* [[Sentential Decision Diagram]], a generalization of OBDDs
* [[Influence diagram]]