ESTIMATION OF TIME ABOUT THE OPTIMAL ALGORITHMS FOR MATRIX MULTIPLICATION AND INTEGER CONVOLUTION
关于矩阵乘法与整数卷积最佳算法运算量的估计

In this paper, we discuss the methods for estimating the number of operationsabout matrix multiplication and integer convolution. It is shown that the time of ma-trix multipliation in 1] and integer convolution in 3], 4] is no less than O(n~3log n) and O(n~2 log n), respectively, more than that of ordinary algorithms, are notoptimal.