A Simple Function that Requires Exponential Size Read-Once Branching Programs

Abstract We present a Boolean function in n variables that is computable in depth 2 monotone AC0 but requires 2 Ω(√n) size read-once branching programs. The function we consider is defined by the blocking sets of a finite projective plane.

[1]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[2]  Petr Savický,et al.  A large lower bound for 1-branching programs , 1996, Electron. Colloquium Comput. Complex..

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

[4]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[5]  Paul E. Dunne,et al.  Lower bounds on the complexity of 1-time only branching programs , 1985, FCT.

[6]  Stephen Ponzio,et al.  A lower bound for integer multiplication with read-once branching programs , 1995, STOC '95.

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

[8]  Stasys Jukna,et al.  Entropy of Contact Circuits and Lower Bounds on Their Complexity , 1988, Theor. Comput. Sci..

[9]  Janos Simon,et al.  A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications , 1992, Advances In Computational Complexity Theory.

[10]  Endre Szemerédi,et al.  A Lower Bound for Read-Once-Only Branching Programs , 1987, J. Comput. Syst. Sci..

[11]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[12]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[13]  Stanislav Zák,et al.  An Exponential Lower Bound for One-Time-Only Branching Programs , 1984, MFCS.

[14]  Stasys Jukna,et al.  A Note on Read-k Times Branching Programs , 1994, RAIRO Theor. Informatics Appl..

[15]  Christoph Meinel,et al.  Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e , 1991, Theor. Comput. Sci..

[16]  Ingo Wegener,et al.  On the complexity of branching programs and decision trees for clique functions , 1988, JACM.