Proof — Strassen's algorithm
Statement
O(n^2.807) matrix multiplication; bilinear complexity. Proved in ZFC.
Proof sketch
ZFC → matrices over ℝ. Bilinear complexity; 2×2 block recursion. Seven multiplications suffice; ω < 2.807.
Source
Donald E. Knuth Prize 2008. O(n^2.807) matrix multiplication; bilinear complexity. Proved in ZFC.
Domains
computer-science