Lower bounds for matrix product

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 358-367

  Shpilka, A ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GATES (TRANSISTOR); LINEAR SYSTEMS; MATHEMATICAL MODELS;

BILINEAR CIRCUITS; QUADRATIC CIRCUITS;

DIGITAL CIRCUITS;

EID: 0035186124     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959910     Document Type: Conference Paper

References (15)

1. 2-lower bound for the rank of n × n-matrix multiplication over arbitrary fields
2. Lower bound for the multiplicative complexity of matrix multiplication
3. A lower bound for matrix multiplication
4. Matrix multiplication via arithmetic progression
5. Algebraic complexity theory
6. Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
7. On the optimal evaluation of a set of bilinear forms
8. Fast probabilistic algorithms for verification of polynomial identities
9. Gaussian elimination is not optimal
10. Vermeidung von divisionen
11. Probabilistic algorithms for sparse polynomials