Jun 3, 2009 · Among the many areas of application are verification, model checking, computer aided design, relational algebra, and symbolic graph algorithms.

We start to fill this gap by determining exact OBDD bounds for two fundamental functions, namely multiplexer MUXn, often also called direct storage access ...

Ordered binary decision diagrams (OBDDs) are nowadays one of the most common dynamic data structures or representation types for Boolean functions.

Ordered binary decision diagrams (OBDDs) are the most common dynamic data structure or representation type for Boolean functions.

Ordered binary decision diagrams (OBDDs) are the most common dynamic data structure or representation type for Boolean functions.

Abstract Ordered binary decision diagrams (OBDDs) are nowadays one of the most common dynamic data structures or representation types for Boolean functions.

Ordered binary decision diagrams (OBDDs) are nowadays one of the most common dynamic data structures or representation types for Boolean functions.

Ordered binary decision diagrams (OBDDs) are the most common dynamic data structure or representation type for Boolean functions.

Abstract Ordered binary decision diagrams (OBDDs) are nowadays one of the most common dynamic data structures or representation types for Boolean functions.

Ordered binary decision diagrams (OBDDs) are the most common dynamic data structure or representation type for Boolean functions.