Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity (1996)
Cached
Download Links
- [www.cs.utoronto.ca]
- [ftp.cs.uchicago.edu]
- [www.cs.utoronto.ca]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 36th |
| Citations: | 35 - 2 self |
BibTeX
@INPROCEEDINGS{Lokam96spectralmethods,
author = {Satyanarayana V. Lokam},
title = {Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity},
booktitle = {In Proc. 36th},
year = {1996},
pages = {6--15}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The rigidity of a matrix measures the number of entries that must be changed in order to reduce its rank below a certain value. The known lower bounds on the rigidity of explicit matrices are very weak. It is known that stronger lower bounds would have implications to complexity theory. We consider restricted variants of the rigidity problem over the complex numbers. Using spectral methods, we derive lower bounds on these variants. Two applications of such restricted variants are given. First, we show that our lower bound on a variant of rigidity implies lower bounds on size-depth tradeoffs for arithmetic circuits with bounded coefficients computing linear transformations. These bounds generalize a result of Nisan and Wigderson. The second application is conditional; we show that it would suffice to prove lower bounds on certain restricted forms of rigidity to conclude several separation results such as separating the analogs of PH and PSPACE in communication complexity theory. Our res...
