Revision as of 02:55, 25 November 2008 edit RayAYang (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 17,189 edits m remove from C class, looks like a stub ← Previous edit		Revision as of 21:43, 28 January 2009 edit undo Jason Quinn (talk \| contribs) Autopatrolled, Administrators 43,842 edits →A 2.496 algorithm by Pan?: new section Next edit →
Line 41: :You reduce your problem to one or many matrix multiplications, for example [http://dx.doi.org/10.1016/j.tcs.2005.09.023 this]. --[[User:Mellum\|Mellum]] ([[User talk:Mellum\|talk]]) 19:43, 10 August 2008 (UTC) == A 2.496 algorithm by Pan? == 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)

Talk:Coppersmith–Winograd algorithm: Difference between revisions