A TAXONOMY OF PROBLEMS WITH FAST PARALLEL ALGORITHMS

被引：374

作者：

COOK, SA

机构：

来源：

INFORMATION AND CONTROL | 1985年 / 64卷 / 1-3期

关键词：

D O I：

10.1016/S0019-9958(85)80041-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：2 / 22

页数：21

共 69 条

[1]

Adleman L., 1978, 19th Annual Symposium on Foundations of Computer Science, P75, DOI 10.1109/SFCS.1978.37

[2]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[3]

AWERBUCH B, 1983, NEW CONNECTIVITY MSF

[4]

BEAME PW, 1984, 17TH P IEEE F COMP S

BERKOWITZ, SJ .

[6] RELATING TIME AND SPACE TO SIZE AND DEPTH [J].

BORODIN, A .

[7] FAST PARALLEL MATRIX AND GCD COMPUTATIONS [J].

BORODIN, A ;

GATHEN, JV ;

HOPCROFT, J .

INFORMATION AND CONTROL, 1982, 52 (03) :241-256

BORODIN, A ;

COOK, S ;

PIPPENGER, N .

INFORMATION AND CONTROL, 1983, 58 (1-3) :113-136

[9]

BORODIN A, 1982, ENSEIGN MATH, P47

[10]

Chandra A. K., 1982, 23rd Annual Symposium on Foundations of Computer Science, P1, DOI 10.1109/SFCS.1982.3