Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complexity of Boolean functions
The complexity of Boolean functions
Reduction of OBDDs in linear time
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
Journal of Computer and System Sciences
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the size of (generalized) OBDDs for threshold functions
Information Processing Letters
Hi-index | 0.00 |
Ordered binary decision diagrams (OBDDs) are the most common dynamic data structure or representation type for Boolean functions. Among the many areas of application are verification, model checking, computer aided design, relational algebra, and symbolic graph algorithms. Although many even exponential lower bounds on the OBDD size of Boolean functions are known, there are only few functions where the OBDD size is even asymptotically known exactly. In this paper the exact OBDD sizes of the fundamental functions multiplexer and addition of n-bit numbers are determined.