说明: 最快的稀疏矩阵乘法运算,英文版 Let A and B two n £ n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B using O(m0:7n1:2 + n2+o(1)) algebraic operations (i.e., mu <kotomifi> 上传 | 大小:184kb