EXPRESSIBILITY AND PARALLEL COMPLEXITY

被引：58

作者：

IMMERMAN, N

机构：

来源：

关键词：

D O I：

10.1137/0218043

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：625 / 638

页数：14

共 20 条

[1]

BARRINGTON DM, 1988, 3RD P ANN C STRUCT C, P47

[2]

BEAME P, 1986, 18TH P ANN ACM S THE, P169

[3] CONSTANT DEPTH REDUCIBILITY [J].

CHANDRA, AK ;

STOCKMEYER, L ;

VISHKIN, U .

[4]

Enderton H. B., 2001, MATH INTRO LOGIC, V2nd ed

[5]

Fagin R., 1974, SIAM AMS P, V7, P27

[6]

FICH FE, 1984, 3RD P ANN ACM S PRIN, P179

[7]

HAREL D, 1982, SPRINGER VERLAG LECT, V140, P313

[8] ON SOME DETERMINISTIC SPACE COMPLEXITY PROBLEMS [J].

HONG, JW .

[9] LANGUAGES THAT CAPTURE COMPLEXITY CLASSES [J].

IMMERMAN, N .

[10] RELATIONAL QUERIES COMPUTABLE IN POLYNOMIAL-TIME [J].

IMMERMAN, N .

INFORMATION AND CONTROL, 1986, 68 (1-3) :86-104