scholarly journals Lower bounds for monotone span programs

1996 ◽  
Vol 6 (1) ◽  
pp. 29-45 ◽  
Author(s):  
Amos Beimel ◽  
Anna G�l ◽  
Mike Paterson
Keyword(s):  
Lower Bounds ◽  
Monotone Span Programs ◽  
Span Programs

scholarly journals Lower Bounds for Monotone Span Programs

1994 ◽  
Vol 1 (46) ◽  
Author(s):  
Amos Beimel
Keyword(s):  
Lower Bounds ◽  
Secret Sharing ◽  
Algebraic Model ◽  
New Technique ◽  
Secret Sharing Schemes ◽  
Branching Programs ◽  
Model Of Computation ◽  
Monotone Span Programs ◽  
Span Programs ◽  
A New Technique

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.

scholarly journals Superpolynomial Lower Bounds for Monotone Span Programs

COMBINATORICA ◽  
1999 ◽  
Vol 19 (3) ◽  
pp. 301-319 ◽  
Author(s):  
László Babai ◽  
Anna Gál ◽  
Avi Wigderson
Keyword(s):  
Lower Bounds ◽  
Monotone Span Programs ◽  
Span Programs

scholarly journals Separating the Power of Monotone Span Programs over Different Fields

2005 ◽  
Vol 34 (5) ◽  
pp. 1196-1215 ◽  
Author(s):  
Amos Beimel ◽  
Enav Weinreb
Keyword(s):  
Monotone Span Programs ◽  
Span Programs
Sign in / Sign up

Export Citation Format

Share Document