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 条

[41] VALUES OF POLYNOMIALS OVER FINITE-FIELDS
GATHEN, JV
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1991, 43 (01) : 141 - 146
[42] COMPLETE FIBONACCI SEQUENCES IN FINITE-FIELDS
BRISON, OJ
FIBONACCI QUARTERLY, 1992, 30 (04): : 295 - 304
[43] SUMS OF POWERS IN LARGE FINITE-FIELDS
SMALL, C
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1977, 65 (01) : 35 - 36
[44] On the Scalar Complexity of Chudnovsky2 Multiplication Algorithm in Finite Fields
Ballet, Stephane
Bonnecaze, Alexis
Thanh-Hung Dang
ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 : 64 - 75
[45] FORMS OF LOW DEGREE IN FINITE-FIELDS
ORZECH, M
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1984, 30 (01) : 45 - 58
[46] ON SOME PROBLEMS IN THE THEORY OF FINITE-FIELDS
SHPARLINSKII, IE
RUSSIAN MATHEMATICAL SURVEYS, 1991, 46 (01) : 165 - 200
[47] FINDING ISOMORPHISMS BETWEEN FINITE-FIELDS
LENSTRA, HW
MATHEMATICS OF COMPUTATION, 1991, 56 (193) : 329 - 347
[48] SEARCHING FOR PRIMITIVE ROOTS IN FINITE-FIELDS
SHOUP, V
MATHEMATICS OF COMPUTATION, 1992, 58 (197) : 369 - 380
[49] ON POLYNOMIALS OF PRESCRIBED HEIGHT IN FINITE-FIELDS
SHPARLINSKII, IE
MATHEMATICS OF THE USSR-SBORNIK, 1988, 135 (1-2): : 247 - 255
[50] DEFINABLE SETS OVER FINITE-FIELDS
CHATZIDAKIS, Z
VANDENDRIES, L
MACINTYRE, A
JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1992, 427 : 107 - 135

← 1 2 3 4 5 →