Jump to content

Talk:Coppersmith–Winograd algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jitse Niesen (talk | contribs) at 00:38, 25 April 2007 (Reverted edits by 169.229.72.10 (talk) to last version by Lavid). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This should probably be tagged as a stub since it doesn't contain the actual algorithm nor much of a discussion past the big O complexity. I'd do it, but I don't know the algorithm. Lavid 19:46, 25 February 2007 (UTC) lavid[reply]