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：

暂无

中图分类号：

学科分类号：

摘要：

15

引用

收藏

页码：1105 / 1118

相关论文

共 35 条

[31] FAST ALGORITHMS FOR 2-D CIRCULAR CONVOLUTIONS AND NUMBER-THEORETIC TRANSFORMS BASED ON POLYNOMIAL-TRANSFORMS OVER FINITE RINGS
RAN, XN
LIU, KJR
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (03) : 569 - 578
[32] IEEM FFT - A FAST AND EFFICIENT TOOL FOR RIGOROUS COMPUTATIONS OF PROPAGATION CONSTANTS AND FIELD DISTRIBUTIONS IN DIELECTRIC GUIDES WITH ARBITRARY CROSS-SECTION AND PERMITTIVITY PROFILES
MROZOWSKI, MP
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, 1991, 39 (02) : 323 - 329
[33] Fast parallel molecular algorithms for DNA-based computation:: Solving the elliptic curve discrete logarithm problem over GF(2n)
Li, Kenli
Zou, Shuting
Xu, Jin
PROCEEDINGS OF THE FRONTIERS IN THE CONVERGENCE OF BIOSCIENCE AND INFORMATION TECHNOLOGIES, 2007, : 749 - 752
[34] Fast parallel molecular algorithms for DNA-based computation:: Solving the elliptic curve discrete logarithm problem over GF(2n)
Li, Kenli
Zou, Shuting
Xv, Jin
JOURNAL OF BIOMEDICINE AND BIOTECHNOLOGY, 2008,
[35] On the merits of flooding/parallel probing-based signaling algorithms for fast automatic setup and tear-down of paths in IP/MPLS-over-optical-networks I
Shami, A
Yet, YH
Assi, C
Dixit, S
Hussein, A
Ali, MA
GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2001, : 2109 - 2113

← 1 2 3 4 →