The exponent-two conjecture for matrix multiplication
Statement
Let denote the exponent of matrix multiplication, equivalently the asymptotic exponent governing the border rank of the matrix multiplication tensors. Exponent-two conjecture.
This would establish the optimal possible asymptotic complexity for matrix multiplication. The source presents it as a special case of a broader conjecture, but no resolution evidence is supplied here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.