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 条

[1] MULTIPLICATIVE COMPLEXITY OF POLYNOMIAL MULTIPLICATION OVER FINITE-FIELDS
KAMINSKI, M
BSHOUTY, NH
JOURNAL OF THE ACM, 1989, 36 (01) : 150 - 170
[2] MULTIPLICATION OF POLYNOMIALS OVER FINITE-FIELDS
BSHOUTY, NH
KAMINSKI, M
SIAM JOURNAL ON COMPUTING, 1990, 19 (03) : 452 - 456
[3] A NEW ALGORITHM FOR MULTIPLICATION IN FINITE-FIELDS
PINCIN, A
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (07) : 1045 - 1049
[4] BIT SERIAL MULTIPLICATION IN FINITE-FIELDS
WANG, MH
BLAKE, IF
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1990, 3 (01) : 140 - 148
[5] CURVES WITH MANY POINTS AND MULTIPLICATION IN FINITE-FIELDS
SHPARLINSKI, IE
TSFASMAN, MA
VLADUT, SG
LECTURE NOTES IN MATHEMATICS, 1992, 1518 : 145 - 169
[6] ON THE DETERMINISTIC COMPLEXITY OF FACTORING POLYNOMIALS OVER FINITE-FIELDS
SHOUP, V
INFORMATION PROCESSING LETTERS, 1990, 33 (05) : 261 - 267
[7] THE COMPLEXITY OF SPARSE POLYNOMIAL INTERPOLATION OVER FINITE-FIELDS
WERTHER, K
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1994, 5 (02) : 91 - 103
[8] THE PARALLEL COMPLEXITY OF EXPONENTIATING POLYNOMIALS OVER FINITE-FIELDS
FICH, FE
TOMPA, M
JOURNAL OF THE ACM, 1988, 35 (03) : 651 - 667
[9] COMMUNICATION COMPLEXITY OF MATRIX COMPUTATION OVER FINITE-FIELDS
CHU, JI
SCHNITGER, G
MATHEMATICAL SYSTEMS THEORY, 1995, 28 (03): : 215 - 228
[10] COMPLEXITY OF CALCULATION OF ELEMENTARY SYMMETRIC FUNCTIONS IN FINITE-FIELDS
MIKHAILIUK, MV
DOKLADY AKADEMII NAUK SSSR, 1979, 244 (05): : 1072 - 1076

← 1 2 3 4 5 →