Superpolynomial Lower Bounds for Monotone Span Programs

monotone span programs

computing explicit functions. The best previous lower bound was by Beimel, Gál, Paterson [7]; our proof exploits a general combinatorial lower bound criterion from that paper. Our lower bounds are based on an analysis of Paley-type bipartite graphs via Weil's character sum estimates. We prove an lower bound for the size of monotone span programs for the clique problem. Our results give the first superpolynomial lower bounds for linear secret sharing schemes.

We demonstrate the surprising power of monotone span programs by exhibiting a function computable in this model in linear size while requiring superpolynomial size monotone circuits and exponential size monotone formulae. We also show that the perfect matching function can be computed by polynomial size (non-monotone) span programs over arbitrary fields.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: August 1, 1996

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Babai, L., Gál, A. & Wigderson, A. Superpolynomial Lower Bounds for Monotone Span Programs. Combinatorica 19, 301–319 (1999). https://doi.org/10.1007/s004930050058

Download citation

  • AMS Subject Classification (1991) Classes:  68Q05, 68R05, 05D05