A lower bound on the complexity of polynomial multiplication over finite fields

被引：6
|
作者：
Kaminski, M [1 ]
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
来源：
SIAM JOURNAL ON COMPUTING | 2005年 / 34卷 / 04期
关键词：
polynomial multiplication; quadratic algorithms; linear recurring sequences; Hankel matrices; error-correcting codes;
D O I：
10.1137/S0097539704442118
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It is shown that computing the coefficients of the product of two degree-n polynomials over a q-element field by means of a quadratic algorithm requires at least (3 + (q-1)(2)/ q(5)+( q- 1)(3)) n - o( n) multiplications.
引用
收藏
页码：960 / 992
页数：33
相关论文
共 50 条
12345