Matrix Rigidity

[1]  Pavel Pudlák,et al.  A note on the use of determinant for proving lower bounds on the size of linear circuits , 2000, Inf. Process. Lett..

[2]  A. Razborov,et al.  Improved lower bounds on the rigidity of Hadamard matrices , 1998 .

[3]  Pavel Pudlák,et al.  Some structural properties of low-rank matrices related to computational complexity , 2000, Theor. Comput. Sci..

[4]  Daniel A. Spielman,et al.  A Remark on Matrix Rigidity , 1997, Inf. Process. Lett..

[5]  Vojtech Rödl,et al.  Boolean Circuits, Tensor Ranks, and Communication Complexity , 1997, SIAM J. Comput..

[6]  Satyanarayana V. Lokam.  Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[7]  Vojtech Rödl,et al.  Some combinatorial-algebraic problems from complexity theory , 1994, Discret. Math..

[8]  Bernard Chazelle.  A spectral approach to lower bounds , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  Pavel Pudlák,et al.  Communication in bounded depth circuits , 1994, Comb..

[10]  Joel Friedman,et al.  A note on matrix rigidity , 1993, Comb..

[11]  L. Valiant.  Why is Boolean complexity theory difficult , 1992 .

[12]  Alexander A. Razborov,et al.  Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..

[13]  A. Lunin.  Operator norms of submatrices , 1989 .

[14]  G. A. Watson.  The Smallest Perturbation of a Submatrix that Lowers the Rank of the Matrix , 1988 .

[15]  G. Stewart,et al.  A generalization of the Eckart-Young-Mirsky matrix approximation theorem , 1987 .

[16]  J. Demmel.  The smallest perturbation of a submatrix which lowers the rank and constrained total least squares problems , 1987 .

[17]  Leslie G. Valiant,et al.  Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.

[18]  Leslie G. Valiant,et al.  Graph-Theoretic Properties in computational Complexity , 1976, J. Comput. Syst. Sci..

[19]  P. Erdoes,et al.  On sparse graphs with dense long paths. , 1975 .

[20]  Jacques Morgenstern,et al.  The Linear Complexity of Computation , 1975, JACM.

[21]  Jacques Morgenstern,et al.  Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.

[22]  A. Hoffman,et al.  The variation of the spectrum of a normal matrix , 1953 .