Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9780898714586 Academic Inspection Copy

Branching Programs and Binary Decision Diagrams

Theory and Applications
Description
Table of
Contents
Google
Preview
Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This work 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 text is one of 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 work investigates the representation size of Boolean functions and efficient algorithms on these representations.
Preface Introduction Chapter 1: Introduction Chapter 2: BPs and Decision Trees (DTs) Chapter 3: Ordered Binary Decision Diagrams (OBDDs) Chapter 4: The OBDD Size of Selected Functions Chapter 5: The Variable-Ordering Problem Chapter 6: Free BDDs (FBDDs) and Read-Once BPs Chapter 7: BDDs with Repeated Tests Chapter 8: Decision Diagrams (DDs) Based on Other Decomposition Rules Chapter 9: Integer-Valued DDs Chapter 10: Nondeterministic DDs Chapter 11: Randomized BDDs and Algorithms Chapter 12: Summary of the Theoretical Results Chapter 13: Applications in Verification and Model Checking Chapter 14: Further CAD Applications Chapter 15: Application in Optimization, Counting, and Genetic Programming Bibliography Index.
Google Preview content