Branching Programs and Binary Decision Diagrams

Theory and Applications
Describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. This book is the first comprehensive description of theory and applications.
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.

UK Delivery:

• Free delivery on all orders of £10 or more.
• £1.49 delivery fee on orders below £10.
• UK orders are shipped via Royal Mail 2nd Class.

International Delivery:

• Flat rate delivery charges vary by country.

Dispatch and Delivery Times:

• All orders are shipped from our warehouse in Northampton, UK within 48 hours of receipt during working hours.
• UK mainland orders typically arrive within 3-5 working days via Royal Mail 2nd Class.
• International estimated delivery times:
• Europe & Channel Islands: 7 to 10 working days
• USA: 7 to 15 working days
• Rest of the World: 9 to 21 working days

View our full delivery infomation here.