A remark on matrix rigidity

Information Processing Letters

Volumn 64, Issue 6, 1997, Pages 283-285

  Shokrollahi, M A ^a   Spielman, D A ^b   Stemann, V ^a  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational complexity; Theory of computation

Indexed keywords

EID: 0008647520     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00190-7     Document Type: Article

References (11)

1. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.
2. P. Bürgisser, M. Clausen, M.A. Shokrollahi, Algebraic Complexity Theory, Springer, Berlin, 1996.
3. J. Friedman, A note on matrix rigidity, Combinatorica 13 (2) (1993) 235-239.
4. P. Kimmel, A. Settle, Reducing the rank of lower triangular all-ones matrix, Tech. Rept. CS 92-21, University of Chicago, 1992.
5. T. Lickteig, Ein elementarer Beweis für eine geometrische Gradschranke für die Zahl der Operationen bei der Berechnung von Polynomen, Diplomarbeit, Univ. Konstanz, 1980.
6. S. Lokam, Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity, in: Proc. 36th Symp. on Foundations of Computer Science, 1995, pp. 6-15.
7. P. Pudlák, Large communication in constant depth circuits, Combinatorica 14 (2) (1994) 203-216.
8. 2/r for one simple matrix, Comment. Math. Univ. Carolinae 32 (2) (1991) 213-218.
9. A. Razborov, On rigid matrices, Manuscript (in Russian).
10. M.A. Tsfasman, S.G. Vlǎdut, Algebraic-Geometric Codes, Mathematics and its Applications, Kluwer Academic Publishers, Dordrecht, 1991.
11. L.G. Valiant, Graph theoretic arguments in low-level complexity, in: Lecture Notes in Computer Science, vol. 53 Springer, Berlin, 1977, pp. 162-176.