Revision as of 12:06, 16 November 2010 edit Mellum (talk \| contribs) Extended confirmed users 819 edits No edit summary ← Previous edit		Revision as of 13:38, 1 April 2011 edit undo Rudolflai (talk \| contribs) 4 edits No edit summary Next edit →
Line 61: :That is exactly what it says currently. --[[User:Mellum\|mellum]] ([[User talk:Mellum\|talk]]) 12:06, 16 November 2010 (UTC) == 'Big News' update == There was previously a sentence describing the existence of some other matrix multiplication algorithm. The boldface and the strange wording lead me to believe that it might be a mis-edit or a draft-note. The sentence is quoted verbatim here: "Big News: Very recently an algorithm with only O(n^1.401) multiplications was found. However only, when the original reading of the matrices and the output are not taken into account." I will try to verify the claims by above. [[User:Rudolflai\|Cheuk Sang Rudolf Lai]] ([[User talk:Rudolflai\|talk]]) 13:38, 1 April 2011 (UTC)

Talk:Coppersmith–Winograd algorithm: Difference between revisions