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
    92 Citations

    Topics from this paper.

    A super-quadratic lower bound for depth four arithmetic circuits
    Orbits and Arithmetical Circuit Lower Bounds
    Lower bound frontiers in arithmetical circuit complexity
    • 1
    • PDF
    Optimal Complexity Lower Bound for Polynomial Multiplication
    A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
    • 3
    • PDF
    Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications
    • V. Grolmusz
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 2002
    • 18
    • PDF
    Lower bounds on the bounded coefficient complexity of bilinear maps
    • 8
    • Highly Influenced
    • PDF
    Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth
    • A. Lingas
    • Mathematics, Computer Science
    • Computational Complexity Conference
    • 2018
    • 1
    • PDF

    References

    SHOWING 1-2 OF 2 REFERENCES
    Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity
    • Satyanarayana V. Lokam
    • Mathematics, Computer Science
    • Proceedings of IEEE 36th Annual Foundations of Computer Science
    • 1995
    • 60
    • Highly Influential
    • PDF
    A Spectral Approach to Lower Bounds with Applications to Geometric Searching
    • B. Chazelle
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1998
    • 31
    • Highly Influential
    • PDF