Talk:Coppersmith–Winograd algorithm: Difference between revisions

Revision as of 00:19, 19 July 2007

Revision as of 13:14, 23 July 2007

Line 5:

: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)

::According to [[Strassen algorithm#History]], there is an algorithm due to Winograd in 1980 and another one published in 1990 by Coppersmith and Winograd. Could it be that your book describes the 1980 algorithm? That would also be worthwhile to describe. Winograd's 1980 algorithm is described at http://www.f.kth.se/~f95-eeh/exjobb/background.html . Alternatively, if you give me the page in your book where I should look at, I could have a look - formulas are the same whatever language the book is written. -- [[User:Jitse Niesen|Jitse Niesen]] ([[User talk:Jitse Niesen|talk]]) 13:14, 23 July 2007 (UTC)