ENGLISH

Branching programs and binary decision diagrams: theory and applications

By Ingo Wegener

Book information

Publisher
Society for Industrial and Applied Mathematics
Year
1987
ISBN
9780898714586, 0898714583
LCC
QA274.76 .W44 2000
Open Library ID
OL17151343M
Language
english
Format
DJVU
Filesize
3 MB (3606622 bytes)
Series
SIAM monographs on discrete mathematics and applications
Pages
419\419
Library
Kolxo3
DPI
300
Time added
2009-07-20 03:45:11

Description

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.

Similar books