Article

# New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing

Electronic Colloquium on Computational Complexity (ECCC) 01/2000; 7. DOI: 10.1007/3-540-44693-1_49
Source: DBLP

ABSTRACT Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as satisfiability test and equality test to be performed efficiently, their limitation lies in the fact that they may require exponential size for important functions. Bryant [8] has shown that any OBDD-representation of the function MULn-1,n, which computes the middle bit of the product of two n-bit numbers, requires at least 2n/8 nodes. In this paper a stronger bound of 2n/2/61 is proven by a new technique, using a recently found universal family of hash functions [23]. As a result, one cannot hope anymore to find reasonable small OBDDs even for the multiplication of relatively short integers, since for only a 64-bit multiplication millions of nodes are required. Further, a first non-trivial upper bound of 7/3 ċ 24n/3 for the OBDD size of MULn-1,n is provided.

0 Bookmarks
·
29 Views
• ##### Article: On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism (Extended Abstract)
[Hide abstract]
ABSTRACT: Branching Programs (BPs) are a well-established com- putation and representation model for Boolean functions. Although exponential lower bounds for restricted BPs such as Read-Once Branching Programs (BP1s) have been known for a long time, the proof of lower bounds for impor- tant selected functions is sometimes difficult. Especially the complexity of fundamental functions such as integer multi- plication in different BP models is interesting. In (4), the first strongly exponential lower bound of  2 n=4 has been proven for the complexity of integer mul- tiplication in the deterministic BP1 model. Here, we con- sider two well-studied BP models which generalize BP1s by allowing a limited amount of nondeterminism and multi- ple variable tests, respectively. More precisely, we prove a lower bound of 2 n=.7k/ for the complexity of integer mul- tiplication in the._; k/-BP model. As a corollary, we obtain that integer multiplication cannot be represented in polyno- mial size by nondeterministic BP1s, if the number of non- deterministic nodes is bounded bylog n log log n !.1/. Furthermore, we show that any.1;Ck/-BP representing in- teger multiplication has a size of 2 n 48.kC1/ . This is not polynomial for kD o.n= log n/.
• Source
• Source
##### Article: Time-Space Tradeoff Lower Bounds for Integer Multiplication and Graphs of Arithmetic Functions (Extended Abstract)
[Hide abstract]
ABSTRACT: We prove exponential size lower bounds for nondeterministic and randomized read-k BPs as well as a time-space tradeo lower bound for unrestricted, deterministic multi-way BPs computing the middle bit of integer multiplication. The lower bound for randomized read-k BPs is superpolynomial as long as the error probability is superpolynomially small. For polynomially small error, we have a polynomial upper bound on the size of approximating read-once BPs for this function. The lower bounds follow from a more general re- sult for the graphs of universal hash classes that is applicable to the graphs of arithmetic functions such as integer multi- plication, convolution, and nite eld multiplication.