A $2n^2-log(n)-1$ lower bound for the border rank of matrix multiplication.

J. M. Landsberg Mateusz Michalek

Published in: CoRR (2016)

Keyphrases

lower bound
matrix multiplication
upper bound
branch and bound algorithm
branch and bound
message passing
worst case
objective function
matrix factorization
np hard
lower and upper bounds
distributed memory
optimal solution
linear programming relaxation
post processing
special case
similarity measure