Subquadratic Simulations of Balanced Formulae by Branching Programs
نویسندگان
چکیده
This paper considers Boolean formulae and their simulations by bounded width branching programs. It is shown that every balanced Boolean formula of size s can be simulated by a constant width (width 5) branching program of length s 1.81 l.... A lower bound for the translational cost from formulae to permutation branching programs is also presented. Key words, branching programs, Boolean formulae, Boolean circuits, group theory AMS subject classifications. 68Q 15, 68Q25
منابع مشابه
Branching Programs for Tree Evaluation
The problem FT h d (k) consists in computing the value in [k] = {1, . . . , k} taken by the root of a balanced d-ary tree of height h whose internal nodes are labelled with d-ary functions on [k] and whose leaves are labelled with elements of [k]. We propose FT h d (k) as a good candidate for witnessing L ( LogDCFL. We observe that the latter would follow from a proof that k-way branching progr...
متن کاملOn uncertainty versus size in branching programs
We propose an information-theoretic approach to proving lower bounds on the size of branching programs. The argument is based on Kraft type inequalities for the average amount of uncertainty about (or entropy of) a given input during the various stages of computation. The uncertainty is measured by the average depth of so-called ‘splitting trees’ for sets of inputs reaching particular nodes of ...
متن کاملOn Learning width Two Branching Programs
We prove that strict width two branching programs or SW2 (which are width two branching programs with exactly two sinks, as defined in [BDFP86]) are properly PAC learnable under any distribution. We also observe that PAC learning monotone width two branching programs (which are width two branching programs with exactly one rejecting sink) is as hard as learning DNF formulae. This work refines b...
متن کاملDelay Modelling for Buffered RLC/RLY Trees
For deep-submicron, high-performance circuits, the inductive effect plays a very important role in determining the circuit delay. In this paper, we derive accurate formulae for modeling the delays of buffered RLY/RLC wires and trees. Our formulae can handle balanced and un-balanced trees and consider buffer insertion. Extensive simulations with HSPICE show that the formulae have high fidelity, ...
متن کاملOn Learning Branching Programs and Small Depth Circuits
This paper studies the learnability of branching programs and small depth circuits with modular and threshold gates in both the exact and PAC learning models with and without membership queries. Some of the results extend earlier works in GG95, ERR95, BTW95]. The main results are as follows. For branching programs we show the following. 1. Any monotone width two branching program (deened by Bor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 1994