FAST PARALLEL ALGORITHMS FOR POLYNOMIAL DIVISION OVER AN ARBITRARY FIELD OF CONSTANTS.

被引：0

作者：

Bini, D. ^{[1
]}

Pan, V. ^{[1
]}

机构：

[1] Univ of Pisa, Pisa, Italy, Univ of Pisa, Pisa, Italy

来源：

Computers & mathematics with applications | 1986年 / 12 A卷 / 11期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：1105 / 1118

共 35 条

[1] FAST PARALLEL ALGORITHMS FOR POLYNOMIAL DIVISION OVER AN ARBITRARY FIELD OF CONSTANTS
BINI, D
PAN, V
COMPUTERS & MATHEMATICS WITH APPLICATIONS-PART A, 1986, 12 (11): : 1105 - 1118
[2] ALGORITHMS FOR FAST POLYNOMIAL DIVISION
KONSTANTINOV, VE
BASHIN, YA
PROGRAMMING AND COMPUTER SOFTWARE, 1988, 14 (02) : 75 - 80
[3] PARALLEL ALGORITHMS FOR MATRIX POLYNOMIAL DIVISION
FAVATI, P
LOTTI, G
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1991, 22 (07) : 37 - 42
[4] FAST PARALLEL CALCULATION OF THE RANK OF MATRICES OVER A FIELD OF ARBITRARY CHARACTERISTIC
CHISTOV, AL
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 63 - 69
[5] A FAST PARALLEL ALGORITHM TO COMPUTE THE RANK OF A MATRIX OVER AN ARBITRARY FIELD
MULMULEY, K
COMBINATORICA, 1987, 7 (01) : 101 - 104
[6] Fast algorithms for discrete polynomial transforms on arbitrary grids
Potts, D
LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 366 : 353 - 370
[7] FAST PARALLEL ALGORITHMS FOR SPARSE MULTIVARIATE POLYNOMIAL INTERPOLATION OVER FINITE-FIELDS
GRIGORIEV, DY
KARPINSKI, M
SINGER, MF
SIAM JOURNAL ON COMPUTING, 1990, 19 (06) : 1059 - 1063
[8] Computability over an arbitrary structure. Sequential and parallel polynomial time
Bournez, O
Cucker, F
de Naurois, PJ
Marion, JY
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2003, 2620 : 185 - 199
[9] Implicit complexity over an arbitrary structure: Sequential and parallel polynomial time
Bournez, O
Cucker, F
de Naurois, PJ
Marion, JY
JOURNAL OF LOGIC AND COMPUTATION, 2005, 15 (01) : 41 - 58
[10] On a construction of modules over a polynomial ring in the case of an arbitrary field
Popov, ON
RUSSIAN MATHEMATICAL SURVEYS, 2004, 59 (03) : 583 - 584

← 1 2 3 4 →