ON THE COMPLEXITY OF MULTIPLICATION IN FINITE-FIELDS

被引：32

|

作者：

LEMPEL, A ^{[1
]}

SEROUSSI, G ^{[1
]}

WINOGRAD, S ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

THEORETICAL COMPUTER SCIENCE | 1983年 / 22卷 / 03期

关键词：

D O I：

10.1016/0304-3975(83)90108-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：285 / 296

页数：12

相关论文

共 50 条

[31] A lower bound on the complexity of polynomial multiplication over finite fields
Kaminski, M
STACS 2005, PROCEEDINGS, 2005, 3404 : 485 - 495
[32] IMPROVING THE TIME-COMPLEXITY OF THE COMPUTATION OF IRREDUCIBLE AND PRIMITIVE POLYNOMIALS IN FINITE-FIELDS
RIFA, J
BORRELL, J
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 539 : 352 - 359
[33] ON COMPUTATIONAL-COMPLEXITY OF SOME ALGEBRAIC-CURVES OVER FINITE-FIELDS
LEBRIGAND, D
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 229 : 223 - 227
[34] A lower bound on the complexity of polynomial multiplication over finite fields
Kaminski, M
SIAM JOURNAL ON COMPUTING, 2005, 34 (04) : 960 - 992
[35] MACLANE COHOMOLOGY OF FINITE-FIELDS
FRANJOU, V
LANNES, J
SCHWARTZ, L
INVENTIONES MATHEMATICAE, 1994, 115 (03) : 513 - 538
[36] NORMAL GENERATORS OF FINITE-FIELDS
AKBIK, S
JOURNAL OF NUMBER THEORY, 1992, 41 (02) : 146 - 149
[37] FUZZY SUBFIELDS OF FINITE-FIELDS
MORDESON, JN
FUZZY SETS AND SYSTEMS, 1992, 52 (01) : 93 - 96
[38] LIKEABLE FUNCTIONS IN FINITE-FIELDS
COHEN, SD
ISRAEL JOURNAL OF MATHEMATICS, 1983, 46 (1-2) : 123 - 126
[39] COMPLETE MAPPINGS OF FINITE-FIELDS
NIEDERREITER, H
ROBINSON, KH
JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1982, 33 (OCT): : 197 - 212
[40] ON RANDOM POLYNOMIALS OVER FINITE-FIELDS
ARRATIA, R
BARBOUR, AD
TAVARE, S
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1993, 114 : 347 - 368

← 1 2 3 4 5 →