Skip to main content
Log in

Superpolynomial Lower Bounds for Monotone Span Programs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and 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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930050058

Navigation