We give a constant a > 0.294 and, for any epsilon > 0, an algorithm for multiplying an N x N matrix by an N x Nalpha matrix with complexity O(N2+epsilon).
By: Don Coppersmith
Published in: Journal of Complexity, volume 13, (no 1), pages 42-9 in 1997
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .