Introduced to the notion of matrix distance products in All Pairs Shortest Paths using Bridging Sets
and Rectangular Matrix Multiplication. Distance product for a rectangular
matrix ==> $c_ij = min{a_ik + b_kj} for 1 <= i,j <= n$
Introduced to Strassen's method of matrix multiplication in Introduction to Algorithms
Looking into Strassen's method, it seems that avos multiplicaiton may be a semiring Strassen algorithm. There are some aspects of multiplicative identity (1, -1) that need to be considered, worked out.
Introduced to the notion of matrix distance products in All Pairs Shortest Paths using Bridging Sets$c_ij = min{a_ik + b_kj} for 1 <= i,j <= n$
and Rectangular Matrix Multiplication. Distance product for a rectangular
matrix ==>
Introduced to Strassen's method of matrix multiplication in Introduction to Algorithms
Looking into Strassen's method, it seems that avos multiplicaiton may be a semiring Strassen algorithm. There are some aspects of multiplicative identity (1, -1) that need to be considered, worked out.