Subquadratic simulations of circuits by branching programs

Boolean circuits and their simulations by bounded-width branching programs are considered. It is shown that every NC/sup 1/ circuit of size s can be simulated by a constant-width branching program of length s/sup 1.811. . ./. Some related group-theoretic results are presented.<<ETX>>

[1]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[2]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

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

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

[6]  Michael Ben-Or,et al.  Computing algebraic formulas with a constant number of registers , 1988, STOC '88.

[7]  Allan Borodin,et al.  Bounds for width two branching programs , 1983, SIAM J. Comput..

[8]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

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

[10]  J. P. Gray,et al.  Configurable hardware: a new paradigm for computation , 1989 .

[11]  D. A. Barrington.  BOUNDED WIDTH BRANCHING PROGRAMS , 1986 .