15-122 Principles of Imperative Computation
Lecture 25: Binary Decision Diagrams

  • Reading: 25-bdds.pdf
  • Code: none
  • Concepts:
    • Functional equivalence
    • Functions-as-data vs. functions-as-functions
    • Integer functions as boolean functions
    • Boolean functions as subsets of inputs
    • Binary Decision Trees (BDTs)
    • (Reduced, Ordered) Binary Decision Diagrams ((RO)BDDs)
    • Sharing
    • Reducedness: Irredundancy and Uniqueness
    • Canonicity
  • Previous lecture: Tries
  • Next lecture: ??

[ Home | Schedule | Assignments | Resources ]
[ Blackboard | academic.cs.15-122 ]

fp@cs
Frank Pfenning