SOME COMPLEXITY RESULTS FOR MATRIX COMPUTATIONS ON PARALLEL PROCESSORS

被引:74
|
作者
GENTLEMAN, WM
机构
关键词
D O I
10.1145/322047.322057
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:112 / 115
页数:4
相关论文
共 50 条
  • [21] MODELING THE COMPLEXITY OF PARALLEL AND VLSI COMPUTATIONS WITH BOOLEAN CIRCUITS
    PAPADOPOULOS, CV
    ANDRONIKOS, TS
    MICROPROCESSORS AND MICROSYSTEMS, 1995, 19 (01) : 43 - 50
  • [22] Massively Parallel Computations of the LZ-complexity of Strings
    Belousov, Alexander
    Ratsaby, Joel
    2014 IEEE 28TH CONVENTION OF ELECTRICAL & ELECTRONICS ENGINEERS IN ISRAEL (IEEEI), 2014,
  • [23] Parallel matrix computations in air pollution modelling
    Owczarz, W
    Zlatev, Z
    PARALLEL COMPUTING, 2002, 28 (02) : 355 - 368
  • [24] Accepting networks of splicing processors:: Complexity results
    Manea, Florin
    Martin-Vide, Carlos
    Mitrana, Victor
    THEORETICAL COMPUTER SCIENCE, 2007, 371 (1-2) : 72 - 82
  • [25] Parallel methods for matrix computations obtained in FEM
    Wencel, Jaroslaw
    Smykowski, Jakub
    Katarzynski, Piotr
    Szymanski, Grzegorz
    PRZEGLAD ELEKTROTECHNICZNY, 2007, 83 (11): : 32 - 34
  • [26] Complexity results for deciding Networks of Evolutionary Processors
    Manea, Florin
    THEORETICAL COMPUTER SCIENCE, 2012, 456 : 65 - 79
  • [27] Parallel matrix computations and their applications for biomagnetic fields
    Zerbe, V
    Keller, H
    Schorcht, G
    ADVANCES IN PARALLEL AND DISTRIBUTED COMPUTING - PROCEEDINGS, 1997, : 139 - 142
  • [28] SOME RESULTS ON THE COMPLEXITY OF EXPLOITING DATA DEPENDENCY IN PARALLEL LOGIC PROGRAMS
    DELCHER, A
    KASIF, S
    JOURNAL OF LOGIC PROGRAMMING, 1989, 6 (03): : 229 - 241
  • [29] SOME THEOREMS ON COMPLEXITY OF NORMAL ALGORITHMS AND COMPUTATIONS
    KANOVICH, MI
    PETRI, NV
    DOKLADY AKADEMII NAUK SSSR, 1969, 184 (06): : 1275 - &
  • [30] FAST COMPUTATIONS FOR SOME MATRIX FUNCTIONS
    WALLACH, Y
    MICROPROCESSING AND MICROPROGRAMMING, 1988, 22 (01): : 23 - 28