Talk:Coppersmith–Winograd algorithm: Difference between revisions

Content deleted Content added
No edit summary
Line 6:
}}
 
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==
Line 57 ⟶ 56:
Thanks,
([[User:Dr. Megadeth|Dr. Megadeth]] ([[User talk:Dr. Megadeth|talk]]) 01:24, 5 May 2009 (UTC))
 
== Bounds ==
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)
 
:That is exactly what it says currently. --[[User:Mellum|mellum]] ([[User talk:Mellum|talk]]) 12:06, 16 November 2010 (UTC)