Superpolynomial lower bounds for monotone span programs

László Babai*, Anna Gál, Avi Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

64 Scopus citations

Abstract

In this paper we obtain the first superpolynomial lower bounds for monotone span programs computing explicit functions. The best previous lower bound was Ω(n5/2) 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 nOmega(log n/log log n) 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.

Original languageEnglish
Pages (from-to)301-319
Number of pages19
JournalCombinatorica
Volume19
Issue number3
DOIs
StatePublished - 1999

Fingerprint

Dive into the research topics of 'Superpolynomial lower bounds for monotone span programs'. Together they form a unique fingerprint.

Cite this