Matrix multiplication in O(n^2.373)
Note that the bound (as given in the paper) is now even better than the one mentioned in this blog (and the title).<p>This is of course huge news after twenty years of people trying to crack this.<p>You need matrices of dimension 1.66x10^91 before this result yields half the number of steps. But if an algorithm exists which made effective omega = 2 then this could have huge implications. So any improvement in techniques, no matter how slight, is very welcome, as it may lead to much more significant improvements later on.