ON COMPUTATIONAL-COMPLEXITY OF SOME ALGEBRAIC-CURVES OVER FINITE-FIELDS

被引：0

|

作者：

LEBRIGAND, D

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 229卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：223 / 227

页数：5

相关论文

共 50 条

[21] ON THE DETERMINISTIC COMPLEXITY OF FACTORING POLYNOMIALS OVER FINITE-FIELDS
SHOUP, V
INFORMATION PROCESSING LETTERS, 1990, 33 (05) : 261 - 267
[22] THE COMPLEXITY OF SPARSE POLYNOMIAL INTERPOLATION OVER FINITE-FIELDS
WERTHER, K
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1994, 5 (02) : 91 - 103
[23] MULTIPLICATIVE COMPLEXITY OF POLYNOMIAL MULTIPLICATION OVER FINITE-FIELDS
KAMINSKI, M
BSHOUTY, NH
JOURNAL OF THE ACM, 1989, 36 (01) : 150 - 170
[24] THE PARALLEL COMPLEXITY OF EXPONENTIATING POLYNOMIALS OVER FINITE-FIELDS
FICH, FE
TOMPA, M
JOURNAL OF THE ACM, 1988, 35 (03) : 651 - 667
[25] COMMUNICATION COMPLEXITY OF MATRIX COMPUTATION OVER FINITE-FIELDS
CHU, JI
SCHNITGER, G
MATHEMATICAL SYSTEMS THEORY, 1995, 28 (03): : 215 - 228
[26] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 199 - 233
[27] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 386 : 199 - 233
[28] ON THE JACOBIAN VARIETY OF SOME ALGEBRAIC-CURVES
GREENBERG, R
COMPOSITIO MATHEMATICA, 1981, 42 (03) : 345 - 359
[29] COMPLEXITY OF COMPUTATION OF EMBEDDED RESOLUTION OF ALGEBRAIC-CURVES
HENRY, JPG
MERLE, M
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 378 : 381 - 390
[30] THE ARITHMETIC OF THE PRODUCT OF 2 ALGEBRAIC-CURVES OVER A FINITE-FIELD
YUI, N
JOURNAL OF ALGEBRA, 1986, 98 (01) : 102 - 142

← 1 2 3 4 5 →