Lower bounds for monotone span programs

Authors:
A. Beimel;A. Gal;M. Paterson
Affiliations:
-;-;-
Venue:
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Year:
1995

Citing 0
Cited 3

Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Tight Bounds on the Information Rate of Secret SharingSchemes

Designs, Codes and Cryptography
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Span programs provide a linear algebraic model of computation. Lower Bounds for span programs imply lower bounds for formula size, symmetric branching programs and for contact schemes. Monotone span programs correspond also to linear secret-sharing schemes. We present a new technique for proving lower bounds for monotone span programs, and prove a lower bound of /spl Omega/(m/sup 2.5/) for the 6-clique function. Our results improve on the previously known bounds for explicit functions.