论文信息 - Subquadratic Simulations of Balanced Formulae by Branching Programs

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.811\ldots}$. A lower bound for the translational cost from formulae to permutation branching programs is also presented.

Richard J. Lipton | Jin-Yi Cai

[1] Denis Thérien,et al. Non-Uniform Automata Over Groups , 1987, Inf. Comput..

[2] Noga Alon,et al. Meanders and Their Applications in Lower Bounds Arguments , 1988, J. Comput. Syst. Sci..

[3] Stephen A. Cook,et al. A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[4] David A. Mix Barrington,et al. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[5] Howard Straubing,et al. Superlinear Lower Bounds for Bounded-Width Branching Programs , 1995, J. Comput. Syst. Sci..

[6] Richard J. Lipton,et al. Subquadratic simulations of circuits by branching programs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7] Frederick J. Gilman,et al. A lower bound on ‖ε’/ε‖ , 1983 .

[8] Vojtech Rödl,et al. Two lower bounds for branching programs , 1986, STOC '86.

[9] Michael Ben-Or,et al. Computing Algebraic Formulas Using a Constant Number of Registers , 1992, SIAM J. Comput..

[10] Nicholas Pippenger,et al. On Simultaneous Resource Bounds (Preliminary Version) , 1979, FOCS 1979.