## Binary Decision Diagrams

### Download From

IEEE### Download Links

- [ls2-www.cs.uni-dortmund.de]
- [www.ics.uci.edu]
- [www.ics.uci.edu]
- [www.ics.uci.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 2 - 0 self |

### BibTeX

@MISC{Bollig_binarydecision,

author = {Beate Bollig and Martin Sauerhoff and Detlef Sieling and Ingo Wegener},

title = {Binary Decision Diagrams},

year = {}

}

### OpenURL

### Abstract

Decision diagrams are a natural representation of finite functions. The obvious complexity measures are length and size which correspond to time and space of computations. Decision diagrams are the right model for considering space lower bounds and time-space trade-o#s. Due to the lack of powerful lower bound techniques, various types of restricted decision diagrams are investigated. They lead to new lower bound techniques and some of them allow e#cient algorithms for a list of operations on boolean functions. Indeed, restricted decision diagrams like ordered binary decision diagrams (OBDDs) are the most common data structure for boolean functions with many applications in verification, model checking, CAD tools, and graph problems. From a complexity theoretical point of view also randomized and nondeterministic decision diagrams are of interest.