%0 Journal Article
%T ON THE COMPLEXITY OF AN ALGORITHM FOR INTEGER VECTOR CONVELUTIONS<br>关于整数向量卷积的一个算法的时间复杂度
%A 张振祥
%J 计算数学
%D 1993
%I 
%X The complexity of the conventional algorithm for cyclic convolution of twon-vectors with integer entries is O(n~2). Wu and Jiang 1] give an "optimal"algorithm with "complexity" O(n). In this paper we conclude that the complexityof their algorithm is not lower than O(n~2 log_2 n), so it is worse than the conve-ntional algorithm.
%K 整数向量卷积
%K 算法
%K 时间复杂度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=C72CF930AF758FA4981186820E2AB123&yid=D418FDC97F7C2EBA&vid=23CCDDCD68FFCC2F&iid=CA4FD0336C81A37A&sid=39EEF47180459690&eid=BB0EA31DB1B01173&journal_id=0254-7791&journal_name=计算数学&referenced_num=2&reference_num=2