Branching Programs and Binary Decision Diagrams – Theory and Applications
Theory and Applications

This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

Ingo Wegener (Author)

9780898714586

Hardback, published 31 July 2000

418 pages
22.8 x 15.1 x 2.6 cm, 0.757 kg

Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The representation size of important and selected functions is estimated, upper and lower bound techniques are studied, efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered. This book is the first comprehensive description of theory and applications. Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book. The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

Preface
Introduction
1. Introduction
2. BPs and Decision Trees (DTs)
3. Ordered Binary Decision Diagrams (OBDDs)
4. The OBDD Size of Selected Functions
5. The Variable-Ordering Problem
6. Free BDDs (FBDDs) and Read-Once BPs
7. BDDs with Repeated Tests
8. Decision Diagrams (DDs) Based on Other Decomposition Rules
9. Integer-Valued DDs
10. Nondeterministic DDs
11. Randomized BDDs and Algorithms
12. Summary of the Theoretical Results
13. Applications in Verification and Model Checking
14. Further CAD Applications
15. Application in Optimization, Counting, and Genetic Programming
Bibliography
Index.

Subject Areas: Miscellaneous items [WZ]