Representing Boolean Functions

video-placeholder
Loading...
查看授课大纲

审阅

4.7(22 个评分)

  • 5 stars
    77.27%
  • 4 stars
    13.63%
  • 3 stars
    9.09%

从本节课中

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.

教学方

  • Placeholder

    Hans Zantema

    prof.dr.

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。