Matrix rigidity

Linear Algebra and Its Applications

Volumn 304, Issue 1-3, 2000, Pages 181-192

  Codenotti, Bruno ^a  

^a CNR   (Italy)

Author keywords

FFT; Linear forms; Lower bounds; Matrix rank; Matrix rigidity; Nonlinear bounds

Indexed keywords

EID: 0034393155     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(99)00225-6     Document Type: Article

References (29)

1. N. Alon, On the rigidity of Hadamard matrices, unpublished manuscript.
2. B. Bollobás. Extremal graph theory, Academic Press, New York, 1978.
3. B. Chazelle, A Spectral Approach to Lower Bounds, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, 674-682.
4. B. Codenotti, P. Pudlák, G. Resta, Some structural properties of low rank matrices related to computational complexity, Theor. Comput. Sci., to appear.
5. Demmel J.W. The smallest perturbation of a submatrix which lowers the rank and constrained total least square problems. SIAM J. Numer. Anal. 24:1987;199-206.
6. Erdos P., Graham R., Szemeredi E. On sparse graphs with dense long paths. Comput. Math. Appl. 1:1975;365-369.
7. Friedman J. A note on matrix rigidity. Combinatorica. 13(2):1993;235-239.
8. G. H. Golub, C. F. Van Loan, Matrix Computations, Johns Hopkins Series in the Mathematical Sciences, p. xvi + 476, The Johns Hopkins University Press, Baltimore, MD 1983.
9. Golub G.H., Hoffman A., Stewart G.W. A generalization of the Eckart-Young-Mirsky approximation theorem. Linear Algebra Appl. 88/89:1988;317-328.
10. Grigoriev D.Yu. Using the notion of separability and independence for proving lower bounds on circuit complexity. Notes of the Leningrad branch of the Steklov Mathematical Institute. 60:1976;38-48.
11. Hoffman A.J., Wielandt H.W. The variation of the spectrum of a normal matrix. Duke Math. J. 20:1953;37-39.
12. 2 Izvestiya of the Armenian Academy Sci. 15(5):1980;379-394.
13. B.S. Kashin, A.A. Razborov, Improved lower bounds on the rigidity of Hadamard Matrices, Preprint, 1997.
14. B.S. Kashin, L. Tzaffiri, Some remarks on the restriction of operators to coordinate subspaces, Technical Report 12, The Landau Center for Research in Mathematical Analysis, The Hebrew University, Jerusalem, 1993/94.
15. Lunin A.A. On operator norms of submatrices. Math. Notes Russian Acad. Sci. 45(3):1989;94-100.
16. Morgenstern J. Note on a lower bound on the linear complexity of the fast fourier transform. J. ACM. 20(2):1973;305-306.
17. Morgenstern J. The linear complexity of computation. J. ACM. 22(2):1975;184-194.
18. N. Nisan, A. Wigderson, On the complexity of bilinear forms, in: Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995, 723-732.
19. Pudlák P. Communication in bounded depth circuits. Combinatorica. 14(2):1994;203-216.
20. P. Pudlák, A note on the use of determinant for proving lower bounds on the size of linear circuits, Electronic Colloquium on Computational Complexity (1998) TR98-042.
21. Pudlák P., Rödl V. Some combinatorial-algebraic problems from complexity theory. Discrete Math. 136:1994;253-279.
22. Pudlák P., Rödl V., Sgall J. Boolean circuits tensor ranks and communication complexity. SIAM J. Comput. 26(3):1997;605-633.
23. Razborov A.A. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica. 10:1990;81-93.
24. L.V. Satyanarayana, Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 6-15.
25. Shokrollahi M.A., Spielman D.A., Stemann V. A remark on matrix rigidity. Inform. Process. Lett. 64(6):1998;283-285.
26. L.G. Valiant, Graph theoretic arguments in low-level complexity, in: Proceedings 6th MFCS, Lecture Notes in Mathematics, vol. 53, 1977, pp. 162-176.
27. Valiant L.G. Graph-theoretic properties in computational complexity. J. Comput. Syst. Sci. 13:1976;278-285.
28. L.G. Valiant, Why is Boolean complexity theory difficult?, in: M. Paterson (Ed.), Boolean Function Complexity, Cambridge University Press, Cambridge, 1992, pp. 84-94.
29. Watson G.A. The smallest perturbation of a submatrix which lowers the rank of a matrix. IMA J. Numer. Anal. 8:1988;295-304.