Abstract
Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations and ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Analyzing the limits of symbolic graph algorithms for the reachability problem Sawitzki (Proc. of LATIN, LNCS, vol. 3887, pp. 781–792, Springer, Berlin, 2006) has presented the first exponential lower bound on the π-OBDD size for the most significant bit of integer multiplication according to one predefined variable order π. Since the choice of the variable order is a main issue to obtain OBDDs of small size the investigation is continued. As a result a new upper bound method and the first non-trivial upper bound on the size of OBDDs according to an arbitrary variable order is presented. Furthermore, Sawitzki’s lower bound is improved.
Similar content being viewed by others
References
Amano, K., Maruoka, A.: Better upper bounds on the QOBDD size of integer multiplication. Discrete Appl. Math. 155, 1224–1232 (2007)
Bollig, B.: On the OBDD complexity of the most significant bit of integer multiplication. In: Proc. of TAMC 2008. LNCS, vol. 4978, pp. 306–317. Springer, Berlin (2008)
Bollig, B.: Larger lower bounds on the OBDD complexity of integer multiplication. In: Proc. of LATA 2009. LNCS, vol. 5457, pp. 212–223. Springer, Berlin (2009)
Bollig, B., Woelfel, P.: A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing. In: Proc. of 33rd STOC, pp. 419–424 (2001)
Bollig, B., Waack, St., Woelfel, P.: Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. Theor. Comp. Sci. 362, 86–99 (2006)
Bollig, B., Woelfel, P.: A lower bound technique for nondeterministic graph-driven read-once branching programs and its applications. Theory Comput. Syst. 38, 671–685 (2005)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35, 677–691 (1986)
Bryant, R.E.: On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. Comput. 40, 205–213 (1991)
De, A., Kurur, P., Saha, C., Sapthariski, R.: Fast integer multiplication using modular arithmetic. In: Proc. of 40th STOC, pp. 499–506 (2008)
Führer, M.: Faster integer multiplication. In: Proc. of 39th STOC, pp. 57–66 (2007)
Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proc. of SODA, pp. 573–582. ACM, New York (2003)
Hromkovič, J.: Communication Complexity and Parallel Computing. Springer, Berlin (1997)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Ponzio, S.: A lower bound for integer multiplication with read-once branching programs. SIAM J. Comput. 28, 798–815 (1998)
Sauerhoff, M.: Private communication (2008)
Sauerhoff, M., Woelfel, P.: Time-space trade-off lower bounds for integer multiplication and graphs of arithmetic functions. In: Proc. of 35th STOC, pp. 186–195 (2003)
Sawitzki, D.: Exponential lower bounds on the space complexity of OBDD-based graph algorithms. In: Proc. of LATIN. LNCS, vol. 3887, pp. 781–792. Springer, Berlin (2006)
Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Process. Lett. 48, 139–144 (1993)
Wegener, I.: Branching Programs and Binary Decision Diagrams—Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)
Woelfel, P.: New bounds on the OBDD-size of integer multiplication via universal hashing. J. Comput. Syst. Sci. 71(4), 520–534 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bollig, B., Klump, J. New Results on the Most Significant Bit of Integer Multiplication. Theory Comput Syst 48, 170–188 (2011). https://doi.org/10.1007/s00224-009-9238-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-009-9238-y