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
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
Fast integer multiplication using modular arithmetic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
New Results on the Most Significant Bit of Integer Multiplication
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and 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
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
| Hi-index | 5.23 |
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 one of the most common dynamic data structures 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) [18].