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 条

[31] On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
Gashkov, S. B. u
Sergeev, S.
DISCRETE MATHEMATICS AND APPLICATIONS, 2013, 23 (01): : 1 - 37
[32] TRUE COMPLEXITY OF POLYNOMIAL PROGRESSIONS IN FINITE FIELDS
Kuca, Borys
PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 2021, 64 (03) : 448 - 500
[33] A quasi-optimal lower bound for skew polynomial multiplication
Chen, Qiyuan
Ye, Ke
PROCEEDINGS OF THE 2024 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2024, 2024, : 74 - 81
[34] On the bounds of the bilinear complexity of multiplication in some finite fields
Ballet, S
Chaumine, J
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2004, 15 (3-4) : 205 - 211
[35] On the bilinear complexity of the multiplication in small finite fields.
Chaumine, Jean
COMPTES RENDUS MATHEMATIQUE, 2006, 343 (04) : 265 - 266
[36] Polynomial spaces over finite fields
Winterhof, A
LINEAR ALGEBRA AND ITS APPLICATIONS, 1999, 295 (1-3) : 223 - 229
[37] An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial
Kaminski, Michael
Xing, Chaoping
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (10) : 6845 - 6850
[38] On the Bounds of the Bilinear Complexity of Multiplication in Some Finite Fields
Stéphane Ballet
Jean Chaumine
Applicable Algebra in Engineering, Communication and Computing, 2004, 15 : 205 - 221
[39] A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization
Li, Wenzheng
Liu, Paul
Vondrak, Jan
PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 140 - 152
[40] A LOWER BOUND ON THE COMPLEXITY OF DIVISION IN FINITE EXTENSION FIELDS AND INVERSION IN QUADRATIC ALTERNATIVE ALGEBRAS
LICKTEIG, T
SIAM JOURNAL ON COMPUTING, 1989, 18 (02) : 209 - 215

← 1 2 3 4 5 →