What are BDDs?

What are BDDs?

f

=

x

0

(

x

1

+

x

2

)

Akers’78, Bryant’86

Index

• Canonical => Constant time equality checking
• Polynomial time Boolean operations e.g. h = f|g

Previous slide

Next slide

Back to the first slide

View Graphic Version