Report
A claimed O(n^2.25) matrix multiplication proof doesn't provide an algorithm
One post credits OpenAI with the claimed proof and says the previous record was O(n^2.37).
TLDR
One poster says OpenAI proved matrix multiplication can be done in O(n^2.25) operations, beating the previous O(n^2.37) record, but adds that the proof is nonconstructive: no algorithm was found. Another says the result makes Don Knuth’s speculation that P = NP could also have a nonconstructive proof seem less far-fetched to them.
Combined views
21
2 Sources, first seen ago
