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 条

[41]

LIPTON RJ, 1976, 9176 YAL U TECH REP

[42] LOG SPACE RECOGNITION AND TRANSLATION OF PARENTHESIS LANGUAGES [J].

LYNCH, N .

[43]

McKenzie P., 1983, 24th Annual Symposium on Foundations of Computer Science, P154, DOI 10.1109/SFCS.1983.74

[44]

MCKENZIE P, 1985, 18185 U TOR DEP COMP

[45] BOUNDS TO COMPLEXITIES OF NETWORKS FOR SORTING AND FOR SWITCHING [J].

MULLER, DE ;

PREPARATA, FP .

[46]

Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI

[47]

Pippenger N., 1979, 20th Annual Symposium of Foundations of Computer Science, P307, DOI 10.1109/SFCS.1979.29

[48] CHARACTERIZATION OF POWER OF VECTOR MACHINES [J].

PRATT, VR ;

STOCKMEYER, LJ .

[49]

Reif J., 1983, 24th Annual Symposium on Foundations of Computer Science, P138, DOI 10.1109/SFCS.1983.29

[50]

REIF JH, 1982, 14TH P ACM S THEOR C, P201