Branching Programs and Binary Decision Diagrams

Wegener, Ingo

ISBN 10: 0898714583 / ISBN 13: 9780898714586

Published by Society for Industrial & Applied Mathematics,U.S., 1987

About this Item

This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations. Series Editor(s): Hammer, Peter. Series: Monographs on Discrete Mathematics & Applications S. Num Pages: 418 pages, bibliography, index. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 233 x 161 x 29. Weight in Grams: 732. . 1987. Hardcover. . . . . Books ship from the US and Ireland.

Seller Inventory # V9780898714586

Bibliographic Details

• Title: Branching Programs and Binary Decision Diagrams
• Publisher: Society for Industrial & Applied Mathematics,U.S.
• Publication Date: 1987
• Language: English
• ISBN 10: 0898714583
• ISBN 13: 9780898714586
• Binding: Hardcover
• Condition: New

About this title

Synopsis

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.

About the Author

Ingo Wegener is a Professor of Computer Science at Universität Dortmund in Dortmund, Germany. He is the author of six books, including The Complexity of Boolean Functions (Wiley-Teubner, 1987), and more than 100 articles. In 1994 he won the Universität Dortmund medal for excellent teaching.