Matrix analysis
Probabilistic communication complexity
Journal of Computer and System Sciences
Acta Informatica
Relations between communication complexity classes
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Lower bounds for polynomial evaluation and interpolation problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
Modified ranks of tensors and the size of circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Threshold circuits of bounded depth
Journal of Computer and System Sciences
Communication complexity and combinatorial lattice theory
Journal of Computer and System Sciences
On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Some combinatorial-algebraic problems from complexity theory
Discrete Mathematics - Special issue: trends in discrete mathematics
The nature of statistical learning theory
The nature of statistical learning theory
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Geometric arguments yield better bounds for threshold circuits and distributed computing
Theoretical Computer Science
Lower bounds for monotone span programs
Computational Complexity
Reducing randomness via irrational numbers
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Communication complexity
Simplified lower bounds for polynomials with algebraic coefficients
Journal of Complexity
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Information Processing Letters
Modern computer algebra
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
Journal of the ACM (JACM)
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
On the rigidity of Vandermonde matrices
Theoretical Computer Science
On the complexity of matrix product
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A linear lower bound on the unbounded error probabilistic communication complexity
Journal of Computer and System Sciences - Complexity 2001
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On testing for zero polynomials by a set of points with bounded precision
Theoretical Computer Science - Computing and combinatorics
Lower bounds on arithmetic circuits via partial derivatives
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
Limitations of learning via embeddings in euclidean half spaces
The Journal of Machine Learning Research
Separating the Power of Monotone Span Programs over Different Fields
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
More on Average Case vs Approximation Complexity
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Journal of Computer and System Sciences - STOC 2001
Lower bounds on the bounded coefficient complexity of bilinear maps
Journal of the ACM (JACM)
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Lower bounds in communication complexity based on factorization norms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating the Radii of Point Sets
SIAM Journal on Computing
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning Complexity vs. Communication Complexity
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Geometrical realization of set systems and probabilistic communication complexity
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Complexity measures of sign matrices
Combinatorica
Polynomial threshold functions, AC functions and spectrum norms
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A spectral approach to lower bounds
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Algebraic Complexity Theory
Quadratic lower bounds on matrix rigidity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Lower bounds on matrix rigidity via a quantum argument
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ACM SIGACT News
Proceedings of the forty-third annual ACM symposium on Theory of computing
On black-box reductions between predicate encryption schemes
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
| Hi-index | 0.00 |
We survey several techniques for proving lower bounds in Boolean, algebraic, and communication complexity based on certain linear algebraic approaches. The common theme among these approaches is to study robustness measures of matrix rank that capture the complexity in a given model. Suitably strong lower bounds on such robustness functions of explicit matrices lead to important consequences in the corresponding circuit or communication models. Many of the linear algebraic problems arising from these approaches are independently interesting mathematical challenges.