Strassen矩阵乘法算法 C++程序源码 V.Strassen在1969年发表了一个算法，将计算两个n阶方阵的乘积的时间复杂性降低到了o（nlog27），被誉为“在代数复杂性理论中最激动人心的结果”。该算法主要适用于方阵的乘法。-Strassen algorithm for matrix multiplication C++ program source V. Strassen published in 1969, an algorithm to compute the product of two n-order square to reduce the time complexity to o (nlog27), known as " algebraic complexity theory in the most exciting results. "　This algorithm is mainly applied to matrix multiplication.