News for hackers. Stuff that matters.
Re:Matrix multiplication in O(n^2.373) by wbhart on Monday November 28, 2011 @11:32PM (#3289063)
Multiplying k arbitrary matrices can be done in less time than O(kn^omega). But certainly for k > 3 you wouldn't multiply naively k times as you've pointed out.

There are no comments on this comment yet.