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

  • Reading: 19-bdds.pdf
  • Code: none
  • Concepts:
    • Boolean functions
    • Coding integer functions as boolean functions
    • Binary decision trees
    • Binary decision diagrams (BDDs)
    • Reduced ordered binary decision diagrams (ROBDDs)
    • Constructing ROBDDs
    • Canonicity of representation
    • Validity
    • Satisfiability
    • Number of solutions
    • Satisfying assignments
  • Previous lecture: Tries
  • Next lecture: ROBDDs

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

fp@cs
Frank Pfenning