A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs

Computational Complexity

Volumn 10, Issue 4, 2001, Pages 277-296

  Gál, Anna ^a  

^a University of Texas at Austin   (United States)

Author keywords

Boolean formula size; Lower bounds; Secret sharing; Span programs

Indexed keywords

EID: 0037699040     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370100001     Document Type: Article

References (42)

1. E. ALLENDRR, R. BEALS & M. OGIHARA (1999). The complexity of matrix rank and feasible systems of linear equations. Comput. Complexity 8, 99-126.
2. N. ALON (1986). Explicit constructions of exponential sized families of κc-independent sets. Discrete Math. 58, 191-193.
3. N. ALON (1996). Personal communication.
4. N. ALON & R. BOPPANA (1987). The monotone circuit complexity of Boolean functions. Combinatorica 7, 1-22.
5. N. ALON, O. GOLDREICH, J. HÅSTAD & R. PERALTA (1992). Simple constructions of almost κr-wise independent random variables. Random Structures Algorithms 3, 289-304.
6. A. ANDREEV (1985). On a method for obtaining lower bounds for the complexity of individual monotone functions. Soviet Math. Dokl. 31, 530-534.
7. Y. AZAR, R. MOTWANI & J. NAOR (1998). Approximating probability distributions using small sample spaces. Combinatorica 18, 151-171.
8. L. BABAI, A. GÁL, J. KOLLÁR. L. RÓNYAI, T. SZABÓ &r A. WIGDERSON (1996). Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In Proc. 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, PA), 603-611.
9. L. BABAI, A. GÁL, & A. WIGDERSON (1999). Superpolynomial lower bounds for monotone span programs. Combinatorica 19, 301-319.
10. A. BEIMEL & A. GÁL (1999). On arithmetic branching programs. J. Comput. System Sci. 59, 195-220.
11. A. BEIMEL, A. GÁL &r M. PATERSON (1996/97). Lower bounds for monotone span programs. Comput. Complexity 6, 29-45.
12. B. BOLLOBÁS (1985). Random Graphs. Academic Press.
13. B. BOLLOBÁS & A. THOMASON (1981). Graphs which contain all small graphs. European J. Combin 2, 13-15.
14. G. BUNTROCK, C. DAMM, H. HERTRAMPF & C. MEINEL (1992). Structure and importance of the logspace-mod class. Math. Systems Theory 25, 223-237.
15. L. CSIRMAZ (1996). The dealer's random bits in perfect secret sharing schemes. Studia Sci. Math. Hungar. 32, 429-437.
16. M. GOLDMANN & J. HÅSTAD (1992). A simple lower bound for monotone clique using a communication game. Inform. Process. Lett. 41, 221-226.
17. R. L. GRAHAM & J. H. SPENCER (1971). A constructive solution to a tournament problem. Canad. Math. Bull. 14, 45-48.
18. M. GRIGNI & M. SIPSER (1992). Monotone complexity. In Boolean Function Complexity, M. Paterson (ed.), London Math. Soc. Lecture Note Ser. 169, Cambridge Univ. Press, 57-75.
19. A. HAKEN (1995). Counting bottlenecks to show monotone P ≠ NP. In Proc. Annual IEEE Symposium on Foundations of Computer Science (Milwaukee, WI), 36-40.
20. J. HÅSTAD (1998). The shrinkage exponent is 2. SIAM J. Comput. 27, 48-64.
21. M. KARCHMER & A. WIGDERSON (1990). Monotone circuits for connectivity require super-logarithmic depth. SIAM J. Discrete Math. 3, 255-265.
22. M. KARCHMER & A. WIGDERSON (1993). On span programs. In Proc. 8th Ann. Symp. Structure in Complexity Theory, 102-111.
23. V. M. KHRAPCHENKO (1972). Methods of determining lower bounds for the complexity of II-schemes. Math. Notes Acad. Sci. USSR 10, 474-479.
24. D. J. KLEITMAN & J. SPENCER (1973). Families of κ-independent sets. Discrete Math. 6, 255-262.
25. E. KUSHILEVITZ & N. NISAN (1997). Communication Complexity. Cambridge Univ. Press.
26. R. LIPTON & R. SEDGEWICK (1981). Lower bounds for VLSI. In Proc. 13th Annual ACM Symposium on the Theory of Computing (Milwaukee, WI), 300-307.
27. K. MEHLHORN & E. SCHMIDT (1982). Las Vegas is better than determinism in VLSI and distributed computing. In Proc. 14th Annual ACM Symposium on the Theory of Computing (San Francisco, CA), 330-337.
28. J. NAOR & M. NAOR (1993). Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22, 838-856.
29. M. NAOR, L. SCHULMAN & A. SRINIVASAN (1995). Splitters and near optimal de-randomization. In Proc. 36th Annual IEEE Symposium on Foundations of Computer Science (Milwaukee, WI), 182-191.
30. P. PUDLÁK & J. SGALL (1996). Algebraic models of computation and interpolation for algebraic proof systems. In Proof Complexity and Feasible Arithmetic, DIMACS Ser. 39, 279-295.
31. R. RAZ & A. WIGDERSON (1992). Monotone circuits for matching require linear depth. J. Assoc. Comput. Mach. 39, 736-744.
32. A. A. RAZBOROV (1985a). A lower bound on the monotone network complexity of the logical permanent. Mat. Zametki 37, 887-900 (in Russian).
33. A. A. RAZBOROV (1985b). Lower bounds for the monotone complexity of some Boolean functions. Soviet Math. Dokl. 31, 354-357.
34. A. A. RAZBOROV (1989). On the method of approximation. In Proc. 21st Annual ACM Symposium on the Theory of Computing (Seattle, WA), 167-176.
35. A. A. RAZBOROV (1990). Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10, 81-93.
36. A. A. RAZBOROV (1992). On submodular complexity measures. In Boolean Function Complexity, M. Paterson (ed.), London Math. Soc. Lecture Note Ser. 169, Cambridge Univ. Press, 76-83.
37. K. L. RYCHKOV (1985). A modification of Khrapchenko's method and its applications to bounds on the complexity of II-schemes and coding functions. Metody Diskret. Anal. 42, 91-98 (in Russian).
38. G. SEROUSSI & N. BSHOUTI (1988). Vector sets for exhaustive testing of logic circuits. IEEE Trans. Inform. Theory 34, 513-522.
39. S. SKYUM & L. G. VALIANT (1985). A complexity theory based on Boolean algebra. J. Assoc. Comput. Mach. 32, 484-502.
40. D. R. STINSON, R., WEI & L. ZHU (2000). Some new bounds for cover free families. J. Combin. Theory Ser. A 90, 224-234.
41. É. TARDOS (1987). The gap between monotone and non-monotone circuit complexity is exponential, Combinatorica 7, 141-142.
42. A. YAO (1979). Some complexity questions related to distributed computing. In Proc. 11th Annual ACM Symposium on the Theory of Computing (Atlanta, GA), 209-213.