Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity

Journal of Computer and System Sciences

Volumn 63, Issue 3, 2001, Pages 449-473

  Lokam, Satyanarayana V ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; DIGITAL ARITHMETIC; LINEARIZATION; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; SET THEORY; SPECTRUM ANALYSIS;

COMBINATORIAL COMPLEXITY; COMMUNICATION COMPLEXITY; LINEAR TRANSFORMATIONS; MATRIX RIGIDITY; SIZE-DEPTH TRADE-OFFS;

COMPUTATIONAL COMPLEXITY;

EID: 0035521408     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1786     Document Type: Article

References (45)

1. On the rigidity of an Hadamard matrix
2. Geometric realizations of set systems and probabilistic communication complexity
3. Trading group theory for randomness
4. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
5. Algebraic complexity theory
6. Arithmetization: A new method in structural complexity theory
7. Complexity classes in communication complexity theory
8. On lower bounds for read-k-times branching programs
9. On ACC
10. A spectral approach to lower bounds
11. A note on matrix rigidity
12. The power of the middle bit
13. The knowledge complexity of interactive proof systems
14. Relations between communication complexity classes
15. The variation of the spectrum of a normal matrix
16. Improved lower bounds on the rigidity of Hadamard matrices
17. Variation ranks of communication matrices and lower bounds for depth-two circuits having symmetric gates with unbounded fan-in
18. Algebraic methods in interactive proof systems
19. Matrix rigidity and communication complexity
20. Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity
21. On the rigidity of Vandermonde matrices
22. Note on a lower bound of the linear complexity of the fast Fourier transform
23. On the complexity of bilinear forms
24. Large communication in constant depth circuits
25. A note on the use of determinant for proving lower bounds on the size of linear circuits
26. Some combinatorial-algebraic problems from complexity theory
27. Boolean circuits, tensor ranks and communication complexity
28. Probabilistic communication complexity
29. 2/r for one simple matrix
30. On rigid matrices
31. Bounds on Depth-2 superconcentrators
32. IP = PSPACE, a simplified proof
33. IP = PSPACE
34. Lower bounds for polynomial evaluation and interpolation
35. A remark on matrix rigidity
36. Randomized polynomials, threshold circuits and polynomial hierarchy
37. PP is as hard as the polynomial hierarchy
38. Graph-theoretic arguments in low-level complexity
39. Some complexity questions related to distributive computing
40. On ACC and threshold circuits