Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complexity of Boolean functions
The complexity of Boolean functions
Finding the Optimal Variable Ordering for Binary Decision Diagrams
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
On the OBDD-Representation of General Boolean Functions
IEEE Transactions on Computers
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Verification techniques for cache coherence protocols
ACM Computing Surveys (CSUR)
Solving Boolean Equations Using ROSOP Forms
IEEE Transactions on Computers
The Theory of Zero-Suppressed BDDs and the Number of Knight‘s Tours
Formal Methods in System Design
Ordered Binary Decision Diagrams and Minimal Trellises
IEEE Transactions on Computers
Theoretical Computer Science
Better upper bounds on the QOBDD size of integer multiplication
Discrete Applied Mathematics
An ROBDD-based combinatorial method for the evaluation of yield of defect-tolerant systems-on-chip
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 14.99 |
Boolean functions are often represented by ordered binary-decision diagrams (OBDDs) introduced by Bryant (1986). Liaw and Lin (1992) have proved upper and lower bounds on the minimal OBDD size of almost all Boolean functions. Now tight bounds are proved for the minimal OBDD size for arbitrary or optimal variable orderings and for the minimal read-once branching program size of almost all functions. Almost all Boolean functions have a sensitivity of almost 1, i.e., the minimal OBDD size for an optimal variable ordering differs from the minimal OBDD size for a worst variable ordering by a factor of at most 1+/spl epsi/(n) where /spl epsi/(n) converges exponentially fast to 0.