Skip to content
Register Sign in Wishlist
Branching Programs and Binary Decision Diagrams

Branching Programs and Binary Decision Diagrams
Theory and Applications

Part of Monographs on Discrete Mathematics and Applications

  • Date Published: July 2000
  • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial null Mathematics for availability.
  • format: Hardback
  • isbn: 9780898714586


Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: July 2000
    • format: Hardback
    • isbn: 9780898714586
    • length: 418 pages
    • dimensions: 236 x 159 x 27 mm
    • weight: 0.749kg
    • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial null Mathematics for availability.
  • Table of Contents

    1. Introduction
    2. BPs and Decision Trees (DTs)
    3. Ordered Binary Decision Diagrams (OBDDs)
    4. The OBDD Size of Selected Functions
    5. The Variable-Ordering Problem
    6. Free BDDs (FBDDs) and Read-Once BPs
    7. BDDs with Repeated Tests
    8. Decision Diagrams (DDs) Based on Other Decomposition Rules
    9. Integer-Valued DDs
    10. Nondeterministic DDs
    11. Randomized BDDs and Algorithms
    12. Summary of the Theoretical Results
    13. Applications in Verification and Model Checking
    14. Further CAD Applications
    15. Application in Optimization, Counting, and Genetic Programming

  • Author

    Ingo Wegener, Universität Dortmund

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.