Login / Signup
Lower bounds for depth 4 formulas computing iterated matrix multiplication.
Hervé Fournier
Nutan Limaye
Guillaume Malod
Srikanth Srinivasan
Published in:
Electron. Colloquium Comput. Complex. (2013)
Keyphrases
</>
lower bound
matrix multiplication
upper bound
branch and bound algorithm
branch and bound
message passing
np hard
objective function
distributed memory
worst case
web applications
vc dimension
lower and upper bounds
depth map
tree decompositions
post processing
computational complexity