Definition: (no definition here, yet, but you can help.)
Also known as ordered binary decision diagram.
See also BDD, reduced ordered binary decision diagram.
Note: OBDD referred to as Oblivious ... by Lance Fortnow, Review of Branching Programs and Binary Decision Diagrams: Theory and Applications, SIGACT News, 33(1):7, March 2002.
Symbolic Boolean manipulation with ordered binary-decision diagrams.
Randal E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers, 35(8):677-691, August 1986.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 12 June 2006.
HTML page formatted Mon Sep 11 09:46:05 2006.
Cite this as:
"OBDD", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 12 June 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/obdd.html
