On span programs

A linear algebraic model of computation the span program, is introduced, and several upper and lower bounds on it are proved. These results yield applications in complexity and cryptography. The proof of the main connection, between span programs and counting branching programs, uses a variant of Razborov's general approximation method.<<ETX>>

[1]  R. E. Krichevskii,et al.  Complexity of Contact Circuits Realizing a Function of Logical Algebra , 1964 .

[2]  Vojtech Rödl,et al.  Lower Bounds to the Complexity of Symmetric Boolean Functions , 1990, Theor. Comput. Sci..

[3]  Alexander A. Razborov,et al.  On the method of approximations , 1989, STOC '89.

[4]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[5]  Eric Allender,et al.  A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7]  Alexander A. Razborov,et al.  Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..

[8]  Michael Sipser,et al.  Boolean Function Complexity: Monotone Complexity , 1992 .

[9]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[10]  C. Papadimitriou,et al.  Two remarks on the power of counting , 1983 .

[11]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[12]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[13]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[14]  A. A. Razborov.  Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits , 1990 .

[15]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[16]  M. Sipser,et al.  Monotone complexity , 1992 .

[17]  Avi Wigderson,et al.  Characterizing non-deterministic circuit size , 1993, STOC '93.

[18]  Vojtech Rödl,et al.  A combinatorial approach to complexity , 1992, Comb..

[19]  Ian Parberry,et al.  On the Construction of Parallel Computers from Various Bases of Boolean Functions , 1986, Theor. Comput. Sci..