Re:Discovering faster matrix multiplication algorithms with ...
by skybrian on Wednesday October 05, 2022 @12:22PM
(#33097524)
Isn’t multiplying two 4x4 matrices a finite problem? What does big O complexity mean in that case?
[ Parent
| on HN ]
Re:Discovering faster matrix multiplication algorithms with ...
by adgjlsfhk1 on Wednesday October 05, 2022 @12:35PM
(#33097719)
any fixed size multiplication algorithm has a corresponding general algorithm where you recursively divide a matrix into blocks and treat each block as an element. for any nxn algorithm that takes k multiplications, this yields a general algorithm with runtime n^log_n(k)
Re:Discovering faster matrix multiplication algorithms with ...
by Rioghasarig on Wednesday October 05, 2022 @12:55PM
(#33098078)
My understanding of this situation is that they found a way to multiply 4x4 matrices that requires fewer multiplications than Strassen's . This implies that that can generalize to a way to multiply n x n matrices with a better theoretical complexity than Strassen's algorithm.