Talk:Coppersmith–Winograd algorithm: Difference between revisions

Revision as of 14:55, 15 May 2007

Revision as of 00:19, 19 July 2007

Line 3:

Actually, I do not think anyone has ever written down the full algorithm. The paper only proves that such an algorithm exists. I do not think we can provide an explanation of the technique here without writing an essay as complex as Coppersmith and Winograd's paper. Publishing a short introduction here and a link to the paper is probably the best we can do. [[User:192.167.206.227|192.167.206.227]] 14:55, 15 May 2007 (UTC)

:Is this the same as the Winograd algorithm for matrix multiplication? I'm reading about Winograd algorithm in one book right now, and it has quite concise explanation of how the algorithm works. I could give this explanation here, but for some reason I'm not quite sure if it is the same thing. The book is available on Internet ([http://www.matf.bg.ac.yu/~ezivkovm/nastava/algoritmi.pdf here's] the link), however it might not be of much use to you since it's in Serbian :P -- [[User:Obradovic Goran|Obradovi&#263; Goran ]] [[User talk:Obradovic Goran|(<font color="red">t</font><font color="blue">a^l</font><font color="gray">k</font>]] 00:19, 19 July 2007 (UTC)