Content deleted Content added
m Signing comment by 143.167.10.35 - "→'fastest known algorithm for square matrix multiplication until 2010'?: new section" |
m →Bounds: Responding to criticism of article |
||
Line 61:
:That is exactly what it says currently. --[[User:Mellum|mellum]] ([[User talk:Mellum|talk]]) 12:06, 16 November 2010 (UTC)
The point about needing to read all elements of both matrices gives us a lower *bound* on the minimum possible exponent, but it doesn't tell us that the *optimal* exponent is 2. In principle, it might be that it is mathematically impossible to do better than an exponent of, say, 2.1. I believe the conjecture is that there is no such problem, i.e. that, for each positive epsilon, there exists an algorithm whose exponent is not more than 2 + epsilon.
[[User:Jumpers for goalposts, enduring image|Jumpers for goalposts, enduring image]] ([[User talk:Jumpers for goalposts, enduring image|talk]]) 15:14, 22 May 2019 (UTC)
== 'Big News' update ==
| |||