Revision as of 20:03, 12 June 2009 edit Pt (talk \| contribs) Extended confirmed users 3,093 edits Added a heading ← Previous edit		Revision as of 22:37, 12 November 2010 edit undo 129.97.120.84 (talk) →algorithm Next edit →
Line 5: \|historical = }} This article needs serious refurbishment. It is obvious that the minimum exponent is 2 because all elements of the matrix need to be read. Group theory is not necessary to prove this. By definition, matrix multiplication requires all elements of BOTH multiplicands. [[Special:Contributions/129.97.120.84\|129.97.120.84]] ([[User talk:129.97.120.84\|talk]]) 22:37, 12 November 2010 (UTC) ==algorithm==

Talk:Coppersmith–Winograd algorithm: Difference between revisions