Branching Programs and Binary Decision Diagrams - Theory and Applications (Hardcover)

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.

General

Imprint:	Society For Industrial & Applied Mathematics,U.S.
Country of origin:	United States
Series:	SIAM Monographs on Discrete Mathematics & Applications, No. 4
Release date:	1987
Authors:	Ingo Wegener
Series editors:	Peter Hammer
Dimensions:	229 x 152 x 27mm (L x W x T)
Format:	Hardcover
Pages:	418
ISBN-13:	978-0-89871-458-6
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Algebra > Groups & group theory
LSN:	0-89871-458-3
Barcode:	9780898714586

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!