%0 Journal Article
%T ESTIMATION OF TIME ABOUT THE OPTIMAL ALGORITHMS FOR MATRIX MULTIPLICATION AND INTEGER CONVOLUTION<br>关于矩阵乘法与整数卷积最佳算法运算量的估计
%A 成礼智
%A 曾泳泓
%J 计算数学
%D 1993
%I 
%X 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.
%K 矩阵
%K 乘法
%K 整数卷积
%K 最佳算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=E14D6D4A05B3436753DD860588F2EEED&yid=D418FDC97F7C2EBA&vid=23CCDDCD68FFCC2F&iid=38B194292C032A66&sid=556C1A86E372B606&eid=3622B70F9C54A9CC&journal_id=0254-7791&journal_name=计算数学&referenced_num=1&reference_num=0