On arithmetic branching programs

We consider the model of arithmetic branching programs, which is a generalization of modular branching programs. We show that, up to a polynomial factor in size, arithmetic branching programs are equivalent to complements of dependency programs. Using this equivalence we prove that dependency programs are closed under conjunction over every field. Furthermore, we show that span programs, an algebraic model of computation introduced by M. Karchmer and A. Wigderson (1993), are at least as strong as arithmetic programs; every arithmetic program can be simulated by a span program of size nod more than twice the size of the arithmetic program. Using the above results we give a new proof that NL/poly/spl sube//spl oplus/L/poly, first proved by A. Wigderson (1995). Our simulation of NL/poly is more efficient, and it holds for logspace counting classes over every field.

[1]  Eric Allender,et al.  Making Nondeterminism Unambiguous , 2000, SIAM J. Comput..

[2]  Avi Wigderson.  NL/poly /spl sube/ /spl oplus/L/poly , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[3]  K. Mulmuley.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..

[4]  Avi Wigderson,et al.  Superpolynomial Lower Bounds for Monotone Span Programs , 1996, Comb..

[5]  Yuval Ishai,et al.  Private simultaneous messages protocols with applications , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[6]  Eric Allender,et al.  The complexity of matrix rank and feasible systems of linear equations , 1999, computational complexity.

[7]  Jeffrey Shallit,et al.  The Computational Complexity of Some Problems of Linear Algebra , 1996 .

[8]  Anna Gál.  A characterization of span program size and improved lower bounds for monotone span programs , 1998, STOC '98.

[9]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[10]  J. Gathen.  Algebraic complexity theory , 1988 .

[11]  Meena Mahajan,et al.  A combinatorial algorithm for the determinant , 1997, SODA '97.

[12]  Avi Wigderson,et al.  Boolean complexity classes vs. their arithmetic analogs , 1996, Random Struct. Algorithms.

[13]  Jirí Sgall,et al.  Algebraic models of computation and interpolation for algebraic proof systems , 1996, Proof Complexity and Feasible Arithmetics.

[14]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[15]  Anna Gál,et al.  Combinatorial methods in boolean function complexity , 1995 .

[16]  Alexander A. Razborov,et al.  Lower Bounds for Deterministic and Nondeterministic Branching Programs , 1991, FCT.

[17]  Lajos Rónyai,et al.  Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs , 1996, STOC '96.

[18]  Jeffrey Shallit,et al.  The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract) , 1997, STACS.

[19]  Noam Nisan,et al.  Lower bounds for non-commutative computation , 1991, STOC '91.

[20]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[21]  Eric Allender.  Making computation count: arithmetic circuits in the nineties , 1997, SIGA.

[22]  Meena Mahajan,et al.  Determinant: Combinatorics, Algorithms, and Complexity , 1997, Chic. J. Theor. Comput. Sci..

[23]  Avi Wigderson,et al.  Boolean complexity classes vs. their arithmetic analogs , 1996 .