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

来源：

关键词：

D O I：

10.1016/0304-3975(83)90108-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：285 / 296

页数：12

共 8 条

[1] ALGEBRAS HAVING LINEAR MULTIPLICATIVE COMPLEXITIES
FIDUCCIA, CM
ZALCSTEIN, Y
[J]. JOURNAL OF THE ACM, 1977, 24 (02) : 311 - 331
[2] GRIGOREV DY, 1978, LOMI E278 PREPR
[3] NEW APPROACH TO ERROR-CORRECTING CODES
LEMPEL, A
WINOGRAD, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (04) : 503 - 508
[4] McWilliams FJ., 1977, THEORY ERROR CORRECT
[5] TOOM AL, 1963, SOV MATH, V4, P714
[6] SOME BILINEAR FORMS WHOSE MULTIPLICATIVE COMPLEXITY DEPENDS ON FIELD OF CONSTANTS
WINOGRAD, S
[J]. MATHEMATICAL SYSTEMS THEORY, 1977, 10 (02): : 169 - 180
[7] Winograd S., 1979, Theoretical Computer Science, V8, P359, DOI 10.1016/0304-3975(79)90017-3
[8] ON NUMBER OF MULTIPLICATIONS NECESSARY TO COMPUTE CERTAIN FUNCTIONS
WINOGRAD, S
[J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 1970, 23 (02) : 165 - &