Revision as of 03:28, 12 June 2009 edit 131.111.213.41 (talk) →algorithm: Lack of explicit construction of the algorithm ← Previous edit		Revision as of 20:03, 12 June 2009 edit undo Pt (talk \| contribs) Extended confirmed users 3,093 edits Added a heading Next edit →
Line 47: 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) == Pseudocode? == Hi,

Talk:Coppersmith–Winograd algorithm: Difference between revisions