An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
نویسنده
چکیده
We prove that each OBDD (ordered binary decision diagram) for the middle bit of n-bit integer multiplication with one of the asymptotically best known variable orders, namely the pairwise ascending order x0, y0, . . . , xn−1, yn−1, requires size (2(6/5)n). This is asymptotically optimal due to an upper bound of the same order by Amano and Maruoka (2007).
منابع مشابه
Bounds on the OBDD-size of integer multiplication via universal hashing
Bryant [5] has shown that any OBDD for the function MULn−1,n, i.e. the middle bit of the n-bit multiplication, requires at least 2n/8 nodes. In this paper a stronger lower bound of essentially 2n/2/61 is proven by a new technique, using a universal family of hash functions. As a consequence, one cannot hope anymore to verify e.g. 128-bit multiplication circuits using OBDD-techniques because the...
متن کاملNew Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
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 functi...
متن کاملAn Exponential Lower Bound of the Size of OBDDs Representing Division
1 Introduction The size of an OBDD [1] largely depends on the variable ordering. It is important to clarify the lower bounds of OBDDs representing arithmetic functions. In this report, we investigate a lower bound of the size of OBDDs representing integer division. More precisely, we focus on each bit of the output of the n-bit / n-bit division, and prove that the size of OBDDs representing the...
متن کاملOptimal Non-Parametric Prediction Intervals for Order Statistics with Random Sample Size
In many experiments, such as biology and quality control problems, sample size cannot always be considered as a constant value. Therefore, the problem of predicting future data when the sample size is an integer-valued random variable can be an important issue. This paper describes the prediction problem of future order statistics based on upper and lower records. Two different cases for the ...
متن کاملDelay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010