A note on monotone complexity and the rank of matrices

Information Processing Letters

Volumn 87, Issue 6, 2003, Pages 321-326

  Gál, Anna ^a   Pudlák, Pavel ^b  

^a University of Texas at Austin   (United States)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

Computational complexity; Lower bounds; Span programs

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATRIX ALGEBRA;

SPAN PROGRAMS;

DATA PROCESSING;

EID: 0042468042     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00334-X     Document Type: Article

References (13)

1. Aho A., Ullman J., Yannakakis M. On notions of information transfer in VLSI circuits. Proc. 15th ACM STOC. 1983;133-139.
2. Alon N., Goldreich O., Håstad J., Peralta R. Simple constructions of almost k -wise independent random variables. Random Struct. Algorithms. 3:1992;289-304.
3. Babai L., Gál A., Kollár J., Rónyai L., Szabó T., Wigderson A. Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. STOC. 1996;603-611.
4. Babai L., Gál A., Wigderson A. Superpolynomial lower bounds for monotone span programs. Combinatorica. 19:(3):1999;301-319.
5. Beimel A., Gál A., Paterson M. Lower bounds for monotone span programs. Comput. Complexity. 6:1996/97;29-45.
6. Gál A. A characterization of span program size and improved lower bounds for monotone span programs. STOC. 1998;429-437. (preliminary version); to appear in Comput. Complexity.
7. Jukna S. Extremal Combinatorics, with Applications in Computer Science. 2000;Springer, Berlin.
8. Karchmer M., Linial N., Newman I., Saks M., Wigderson A. Combinatorial characterization of read-once formulae. Discrete Math. 114:1993;275-285.
9. Karchmer M., Wigderson A. Monotone circuits for connectivity require super-logarithmic depth. SIAM J. Discrete Math. 3:(2):1990;255-265.
10. Karchmer M., Wigderson A. On span programs. Proc. 8th Ann. IEEE Symp. Structure in Complexity Theory. 1993;102-111.
11. Kushilevitz E., Nisan N. Communication Complexity. 1997;Cambridge University Press.
12. Mehlhorn K., Schmidt E. Las Vegas is better than determinism in VLSI and distributed computing. Proc. 14th STOC. 1982;330-337.
13. Razborov A.A. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica. 10:1990;81-93.