Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Reduced order LQG controllers for linear time varying plants
Systems & Control Letters
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
A Lower Bound for Integer Multiplication with Read-Once Branching Programs
SIAM Journal on Computing
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Theory of Computing Systems
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
Theoretical Computer Science
Better upper bounds on the QOBDD size of integer multiplication
Discrete Applied Mathematics
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Exponential lower bounds on the space complexity of OBDD-Based graph algorithms
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A note on the size of OBDDs for the graph of integer multiplication
Information Processing Letters
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
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
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Randomized OBDDs for the most significant bit of multiplication need exponential space
Information Processing Letters
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Larger lower bounds on the OBDD complexity of integer multiplication
Information and Computation
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
A larger lower bound on the OBDD complexity of the most significant bit of multiplication
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
| Hi-index | 0.00 |
Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations. Ordered binary decision diagrams (OBDDs) are the most common dynamic data structure for boolean functions. Among the many areas of application are verification, model checking, computer-aided design, relational algebra, and symbolic graph algorithms. In this paper it is shown that the OBDD complexity of the most significant bit of integer multiplication is exponential answering an open question posed by Wegener (2000).