Abstract.
We give a characterization of span program size by a combinatorial-algebraic measure. The measure we consider is a generalization of a measure on covers which has been used to prove lower bounds on formula size and has also been studied with respect to communication complexity.¶In the monotone case our new methods yield \( \textit{n}^{\Omega(\log n)} \)lower bounds for the monotone span program complexity of explicit Boolean functions in n variables over arbitrary fields, improving the previous lower bounds on monotone span program size. Our characterization of span program size implies that any matrix with superpolynomial separation between its rank and cover number can be used to obtain superpolynomial lower bounds on monotone span program size. We also identify a property of bipartite graphs that is suficient for constructing Boolean functions with large monotone span program complexity.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 30, 2000.
Rights and permissions
About this article
Cite this article
Gàl, A. A characterization of span program size and improved lower bounds for monotone span programs. Comput. complex. 10, 277–296 (2001). https://doi.org/10.1007/s000370100001
Issue Date:
DOI: https://doi.org/10.1007/s000370100001