Re:Matrix multiplication in O(n^2.373)
by wbhart on Monday November 28, 2011 @09:15PM
(#3288651)
Except that this algorithm can't be used for anything as small as n = 100. Essentially the analysis is asymptotic, meaning that you have matrices of dimension n = q^N and let N tend towards infinity to get your bound on omega.
[ Parent
| on HN ]
There are no comments on this comment yet.