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 Lavid (talk | contribs) at 19:46, 25 February 2007 (←Created page with '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 kn...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Coppersmith–Winograd_algorithm&oldid=110888682"