Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
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
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Computing strongly connected components in a linear number of symbolic steps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Verification of Synchronous Sequential Machines Based on Symbolic Execution
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Fast integer multiplication using modular arithmetic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
New Results on the Most Significant Bit of Integer Multiplication
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the OBDD complexity of the most significant bit of integer multiplication
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Exponential lower bounds on the space complexity of OBDD-Based graph algorithms
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Randomized OBDDs for the most significant bit of multiplication need exponential space
Information Processing Letters
Randomized OBDDs for the most significant bit of multiplication need exponential size
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
| Hi-index | 0.00 |
Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. The reachability problem, i.e., computing the set of nodes reachable from a predefined vertex s∈V in a digraph G=(V,E), is an important problem in computer-aided design, hardware verification, and model checking. Sawitzki (2006) has presented exponential lower bounds on the space complexity of a restricted class of symbolic OBDD-based algorithms for the reachability problem. Here, these lower bounds are improved by presenting a larger lower bound on the OBDD complexity of the most significant bit of integer multiplication.