Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Information Processing Letters
The complexity of Boolean functions
The complexity of Boolean functions
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Efficient data structures for Boolean functions
Discrete Mathematics - Special issue: trends in discrete mathematics
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Evolving binary decision diagrams with emergent variable orderings
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
| Hi-index | 0.00 |
Ordered binary decision diagrams (OBDDs) and their variants are motivated by the need to represent Boolean functions in applications. Research concerning these applications leads also to problems and results interesting from a theoretical point of view. In this paper, methods from communication complexity and information theory are combined to prove that the direct storage access function and the inner product function have the following property. They have linear π-OBDD size for some variable ordering π and, for most variable orderings π′ all functions which approximate them on considerably more than half of the inputs, need exponential π′-OBDD size. These results have implications for the use of OBDDs in experiments with genetic programming.