Branching programs and binary decision diagrams : theory and applications / Ingo Wegener.

Format:

Book

Author/Creator:

Wegener, Ingo.

Contributor:

Society for Industrial and Applied Mathematics.

Series:

SIAM monographs on discrete mathematics and applications ; 4.

SIAM monographs on discrete mathematics and applications ; 4

Language:

English

Subjects (All):

Branching processes.

Decision making--Mathematical models.

Decision making.

Computational complexity.

Physical Description:

1 electronic text (x, 408 p.) : ill., digital file.

Place of Publication:

Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 2000.

Language Note:

English

System Details:

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Summary:

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.

Contents:

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.

Notes:

Bibliographic Level Mode of Issuance: Monograph

Includes bibliographical references (p. 379-402) and index.

Title from title screen, viewed 12/30/2010.

ISBN:

0-89871-978-X

Publisher Number:

DT04 SIAM