Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR02-012 | 3rd February 2002 00:00

On the Complexity of Matrix Product

RSS-Feed




TR02-012
Authors: Ran Raz
Publication: 5th February 2002 19:06
Downloads: 2785
Keywords: 


Abstract:

We prove a lower bound of $\Omega(m^2 \log m)$ for the size of
any arithmetic circuit for the product of two matrices,
over the real or complex numbers, as long as the circuit doesn't
use products with field elements of absolute value larger than 1
(where $m \times m$ is the size of each matrix).
That is, our lower bound is super-linear in the number of inputs
and is applied for circuits that use addition gates, product gates
and products with field elements of absolute value up to 1.

More generally, for any $c = c(m) \ge 1$,
we obtain a lower bound of $\Omega(m^2 \log_{2c} m)$ for the size of
any arithmetic circuit for the product of two matrices
(over the real or complex numbers), as long as the circuit doesn't
use products with field elements of absolute value larger than $c$.

We also prove size-depth tradeoffs for such circuits.



ISSN 1433-8092 | Imprint