Representing Boolean Functions

video-placeholder
Loading...
View Syllabus

Reviews

4.7 (24 ratings)

  • 5 stars
    79.16%
  • 4 stars
    12.50%
  • 3 stars
    8.33%

From the lesson

BDDs part 1

In this module BDDs (binary decision diagrams) are introduced as decision trees with sharing. They represent boolean functions. Extra requirements on both decision trees and BDDs are presented from which uniqueness of the representation can be concluded.

Taught By

  • Placeholder

    Hans Zantema

    prof.dr.

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.