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 条

[61] TAPE COMPLEXITY OF DETERMINISTIC CONTEXT-FREE LANGUAGES [J].

SUDBOROUGH, IH .

[62]

TOMPA M, 1984, COMMUNICATION

[63] FAST PARALLEL COMPUTATION OF POLYNOMIALS USING FEW PROCESSORS [J].

VALIANT, LG ;

SKYUM, S ;

BERKOWITZ, S ;

RACKOFF, C .

[64]

VALIANT LG, 1979, 11TH P ANN ACM S THE, P249

[65]

VISHKIN U, 1983, SYNCHRONOUS PARALLEL

[66]

VONZURGATHEN J, 1983, 15TH P STOC, P17

[67]

Wilson C. B., 1983, 24th Annual Symposium on Foundations of Computer Science, P329, DOI 10.1109/SFCS.1983.66

[68]

[No title captured]

[69]

[No title captured]