Branching Programs and Binary Decision Diagrams: Theory and Applications - Rilegato

Wegener, Ingo

 
9780898714586: Branching Programs and Binary Decision Diagrams: Theory and Applications

Sinossi

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

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Descrizione del libro

This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. Efficient algorithms for operations on these representations are presented, and the limits of those techniques are considered.

Contenuti

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.