Lower Bounds for Monotone Span Programs

  • Amos Beimel

Abstract

The model of span programs is a linear algebraic model of computation. Lower bounds for span programs imply lower bounds for contact schemes, symmetric branching programs and for formula size. Monotone span programs correspond also to linear secret-sharing schemes. We present a new technique for proving lower bounds for monotone span programs. The main result proved here yields quadratic lower bounds for the size of monotone span programs, improving on the largest previously known bounds for explicit functions. The bound is asymptotically tight for the function corresponding to a class of 4-cliques.
Published
1994-12-15
How to Cite
Beimel, A. (1994). Lower Bounds for Monotone Span Programs. BRICS Report Series, 1(46). https://doi.org/10.7146/brics.v1i46.21596