BDDs -- design, analysis, complexity, and applications. (Q1428568)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: BDDs -- design, analysis, complexity, and applications. |
scientific article; zbMATH DE number 2062826
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | BDDs -- design, analysis, complexity, and applications. |
scientific article; zbMATH DE number 2062826 |
Statements
BDDs -- design, analysis, complexity, and applications. (English)
0 references
29 March 2004
0 references
A binary decision diagram (BDD) is a labelled acyclic graph that represents some Boolean functions. They, and similar devices, are used in many different fields such as hardware design and verification, the design and analysis of algorithms, computational complexity theory, and model checking. This paper is a highly readable survey of BDDs, their variants and various uses. Real world applications are emphasized and illustrated by examples.
0 references
binary decision diagrams
0 references
complexity classes
0 references
truth functions
0 references
switching circuits
0 references
design of algorithms
0 references
model checking
0 references
0 references
0 references
0 references
