ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ω\omega denote the exponent of matrix multiplication, equivalently the asymptotic exponent governing the border rank of the matrix multiplication tensors. Exponent-two conjecture.

ω=2.\omega=2.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.