Open AccessBook
Data structures for Boolean functions
Christoph Meinel,Christian Stangier +1 more
- 01 Jan 2001
- pp 61-78
1
TL;DR: This article gives an outline of a lecture about ordered binary decision diagrams (OBDDs).
read more
Abstract: This article gives an outline of a lecture about ordered binary decision diagrams (OBDDs). Introduced in 1986, OBDDs nowadays are the state-of-the-art data structure for representation of Boolean functions in electronic design automation (EDA). An overview is given about the data structure, its properties, algorithmic behaviour, and the most important applications. Proofs and technical details have been omitted but can be found all in [28].
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Computational Discrete Mathematics
Helmut Alt
- 01 Jan 2001
TL;DR: This work presents a description of this puzzle of the apparent duality between the nonlinear Kerdock and Preparata codes and a brief introduction to codes over Z4.
53
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
Symbolic Boolean manipulation with ordered binary-decision diagrams
TL;DR: The OBDD data structure is described and a number of applications that have been solved by OBDd-based symbolic analysis are surveyed.
Related Papers (5)
Enrico Macii,G. Odasso,Massimo Poncino +2 more
- 01 Nov 1998
Tsutomu Sasao,Jon T. Butler +1 more
- 15 Jan 2010