Talk:Computational complexity of matrix multiplication: Difference between revisions

Revision as of 12:12, 27 September 2021

Revision as of 19:55, 29 September 2021

Line 4:

== Merge from [[Matrix multiplication algorithm]] ==

I propose merging [[Matrix multiplication algorithm]] into [[Computational complexity of matrix multiplication]]. I think the content in ''Matrix multiplication algorithm'' can easily be explained in the context of ''Computational complexity of matrix multiplication'', and a merger would not cause any article-size or [[WP:UNDUE|weighting]] problems in ''Computational complexity of matrix multiplication''.[[Special:Contributions/129.177.124.226|129.177.124.226]] ([[User talk:129.177.124.226|talk]]) 12:12, 27 September 2021 (UTC)

:I think this might be a good idea. From my perspective, the theoretical computer science question of sub-cubic algorithms is a topic of interest meriting its own article, with questions of distributed algorithms and cache behavior being more secondary. However, I think this might not be a consensus belief, which is why I separated sub-cubic algorithms into its own article [[Computational complexity of matrix multiplication]] rather than restructuring [[Matrix multiplication algorithm]]. In any case, a merge is appropriate if having both articles seems redundant. [[User:Fawly|Fawly]] ([[User talk:Fawly|talk]]) 19:55, 29 September 2021 (UTC)