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)
[ Parent
| on HN ]
There are no comments on this comment yet.