Branching Programs and Binary Decision Diagrams

Branching Programs and Binary Decision Diagrams

4.11 - 1251 ratings - Source

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.In such a situation, one may switch to other BDD models like ZBDDs, FBDDs with a fixed graph ordering, OFDDs, OKFDDs, partitioned BDDs with fixed window functions, or to some word-level representation. OKFDDs have the advantage thatanbsp;...

Title:Branching Programs and Binary Decision Diagrams
Author: Ingo Wegener
Publisher:SIAM - 2000

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.

Click button below to register and download Ebook
Privacy Policy | Contact | DMCA