Some structural properties of low-rank matrices related to computational complexity

Theoretical Computer Science

Volumn 235, Issue 1, 2000, Pages 89-107

  Codenotti, Bruno ^a   Pudlák, Pavel ^b   Resta, Giovanni ^a  

^a CNR   (Italy)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

Cycles in graphs; Linear circuits; Low rank matrices; Matrix rigidity; Ramsey number

Indexed keywords

EID: 0002583682     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00185-1     Document Type: Article

References (20)

1. N. Alon, Explicit Ramsey graphs and orthonormal labelings, Electron. J. Combin. 1 (1994) R12.
2. N. Alon, M. Szegedy, Large sets of nearly orthogonal vectors, preprint.
3. R. Bellman, Introduction to Matrix Analysis, McGraw-Hill, New York, 1960.
4. R.A. Brualdi, H.J. Ryser, Combinatorial Matrix Theory, 1991, Cambridge University Press, Cambridge.
5. P. Erdös, R. Rado, Intersection theorems for systems of sets, J. London Math. Soc. 35 (1960) 85-90.
6. J. Friedman, A note on matrix rigidity, Combinatorica 13(2) (1993) 235-239.
7. Z. Füredi, On finite set-systems whose every intersection is a Kernel of a star, Discr. Math. 47 (1983) 129-132.
8. J. Håstad, S. Jukna, P. Pudlák, Top-down lower bounds for depth-three circuits, Comput. Complexity 5 (1995) 99-112.
9. B.S. Kashin, A.A. Razborov, Improved lower bounds on the rigidity of Hadamard matrices, preprint, 1997.
10. A. Kotlov, L. Lovász, The rank and size of graphs, J. Graph Theory 23(1) (1996) 185-189.
11. n], SIAM J. Comput. 4(2) (1975) 175-186.
12. N. Nisan, A. Wigderson, On Rank vs Communication Complexity, Proc. 35th IEEE FOCS, 1994, pp. 831-836.
13. P. Pudlák, V. Rödl, J. Sgall, Boolean circuits, tensor ranks and communication complexity, SIAM J. Comput. 26/3 (1997) 605-633.
14. A.A. Razborov, Lower bounds on the monotone complexity of some boolean functions, Sov. Math. Dokl. 31 (1985) 354-357.
15. A.A. Razborov, On rigid matrices, typeset manuscript in Russian, 1989.
16. R. Raz, B. Spiker, On the log-rank conjecture in communication complexity, Proc. 34th IEEE FOCS, 1993, pp. 168-176.
17. d, DIMACS Ser. Discrete Math. 4 (1991) 489-492.
18. R. Sinkhorn, P. Knopp, Concerning nonnegative matrices and doubly stochastic matrices, Pacific J. Math. 21 (2) (1967) 343-348.
19. L.G. Valiant, Graph-theoretic arguments in low level complexity, Proc. 6th MFCS, Lecture Notes in Mathematics, Vol. 53, Springer, Berlin, 1977, pp. 162-176.
20. 10's, J. Combin. Theory Ser. B 52 (1991) 113-116.