Complexity of matrix multiplication
What is the fastest possible algorithm for multiplying two matrices?
Summary
Algorithms faster than the schoolbook method have been known since Strassen’s in 1969, but the optimal number of operations needed to multiply two n × n matrices is unknown.
Source
Open, as listed by Wikipedia · Unsolved problems in computer science. Checked 29 Sep 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.
