Lower bounds for matrix product, in bounded depth circuits with arbitrary gates

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 409-418

  Raz, R ^a   Shpilka, A ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DIGITAL ARITHMETIC; LOGIC GATES; MATRIX ALGEBRA;

ARITHMETIC CIRCUITS;

LOGIC CIRCUITS;

EID: 0034834489     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380833     Document Type: Conference Paper

References (20)

1. 1-formulae on finite structures
2. The complexity of partial derivatives
3. A 5/2 lower bound for the rank of n × n matrix multiplication over arbitrary fields
4. A lower bound for matrix multiplication
5. Superconcentrators, generalizer and generalized connectors
6. Parity, circuits, and the polynomial-time hierarchy
7. Algebraic complexity theory
8. An exponential lower bound for depth 3 arithmetic circuits
9. Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields
10. Threshold circuits of bounded depth
11. Almost optimal lower bounds for small depth circuits
12. Size-depth trade-offs for threshold circuits
13. Communication in bounded depth circuits
14. Lower bounds for the size of circuits with bounded depth with basis {Λ, ⊕}
15. Depth-3 arithmetic formulae over fields of characteristic zero
16. Algebraic methods in the theory of lower bounds for Boolean circuit complexity
17. Gaussian elimination is not optimal
18. Die berechnungskomplexiät von elementarsymmetrischen funktionen und von interpolationskoeffizienten
19. Graph-theoretic arguments in low-level complexity
20. Separating the polynomial hierarchy by oracles