• DOI:10.1145/509907.509932
Corpus ID: 9582328

On the complexity of matrix product

@article{Raz2002OnTC,
  title={On the complexity of matrix product},
  author={R. Raz},
  journal={Electron. Colloquium Comput. Complex.},
  year={2002}
}

R. Raz

Published 2002

Computer Science, Mathematics

Electron. Colloquium Comput. Complex.

We prove a lower bound of &OHgr;(m2 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 mxm 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… CONTINUE READING

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed