Content deleted Content added
Jason Quinn (talk | contribs) →A 2.496 algorithm by Pan?: new section |
Dr. Megadeth (talk | contribs) No edit summary |
||
Line 45:
The Numerical recipes book (at the end of chapter 2) mentions an article from 1984 in SIAM review (vol 26 pp 393--415) that proved a big-O of 2.496 was possible. I haven't found a mention yet of this bound on wikipedia. It's worth mentioning (if it was a valid paper... I'm not a member of SIAM to even read it) as it was a better algorithm than the strassen one for a while before this one. [[User:Jason Quinn|Jason Quinn]] ([[User talk:Jason Quinn|talk]]) 21:43, 28 January 2009 (UTC)
Hi,
I was wondering if someone could include the pseudocode for the Coppersmith-Winograd algorithm (if no one wants to do it, I would actually like to know where I can find it for my own interests).
Thanks,
([[User:Dr. Megadeth|Dr. Megadeth]] ([[User talk:Dr. Megadeth|talk]]) 01:24, 5 May 2009 (UTC))
| |||