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

DOI10.1145/380752.380833zbMath1323.68306OpenAlexW1977010224MaRDI QIDQ5175996

Amir Shpilka, Ran Raz

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380833

Mathematics Subject Classification ID

Related Items (2)

Affine projections of symmetric polynomials. ⋮ Lower bounds for depth-three arithmetic circuits with small bottom fanin

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Lower bounds for matrix product, in bounded depth circuits with arbitrary gates