LIMITS ON THE POWER OF CONCURRENT-WRITE PARALLEL MACHINES

被引：8

作者：

BEAME, P

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

[2] UNIV TORONTO,TORONTO M5S 1A1,ONTARIO,CANADA

来源：

INFORMATION AND COMPUTATION | 1988年 / 76卷 / 01期

关键词：

D O I：

10.1016/0890-5401(88)90040-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：13 / 28

页数：16

共 19 条

[1] SIGMA-11-FORMULAE ON FINITE STRUCTURES [J].

AJTAI, M .

ANNALS OF PURE AND APPLIED LOGIC, 1983, 24 (01) :1-48

[2]

BABAI L, 1984, COMMUNICATION

[3]

BEAME PW, 1985, UNPUB LOWER BOUNDS V

[4] CONSTANT DEPTH REDUCIBILITY [J].

CHANDRA, AK ;

STOCKMEYER, L ;

VISHKIN, U .

SIAM JOURNAL ON COMPUTING, 1984, 13 (02) :423-439

[5]

COOK SA, 1984, SIAM J COMPUT, V15, P87

[6]

DERHEIDE FMA, 1984, 25TH P IEEE S F COMP, P56

[7]

DERHEIDE FMA, 1985, 26TH P IEEE ANN S F, P532

[8]

FICH FE, 1985, 17TH P ANN ACM S THE, P48

[9] PARITY, CIRCUITS, AND THE POLYNOMIAL-TIME HIERARCHY [J].

FURST, M ;

SAXE, JB ;

SIPSER, M .

MATHEMATICAL SYSTEMS THEORY, 1984, 17 (01) :13-27

[10] PARALLEL COMPUTATION AND CONFLICTS IN MEMORY ACCESS [J].

KUCERA, L .

INFORMATION PROCESSING LETTERS, 1982, 14 (02) :93-96

← 1 2 →