SYMMETRIC SPACE-BOUNDED COMPUTATION

被引：89

作者：

LEWIS, HR

PAPADIMITRIOU, CH

机构：

[1] MIT,DEPT ELECT ENGN & COMP SCI,CAMBRIDGE,MA 02139

[2] NATL TECH UNIV ATHENS,DEPT COMP SCI,GR-147 ATHENS,GREECE

来源：

关键词：

D O I：

10.1016/0304-3975(82)90058-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：161 / 187

页数：27

共 23 条

[1]

Aleliunas R., 1979, 20th Annual Symposium of Foundations of Computer Science, P218, DOI 10.1109/SFCS.1979.34

[2]

Book R. V., 1976, Theoretical Computer Science, V1, P215, DOI 10.1016/0304-3975(76)90057-8

COOK, SA .

[4]

CYPHER A, 1980, 12TH P STOC, P211

[5] THE DIRECTED SUBGRAPH HOMEOMORPHISM PROBLEM [J].

FORTUNE, S ;

HOPCROFT, J ;

WYLLIE, J .

[6]

Garey M. R., 1978, COMPUTERS INTRACTABI

[7] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].

GILL, J .

[8]

HONG JW, 1980, 12TH P ACM S THEOR C, P310

[9]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[10]

HOPCROFT JD, 1971, J ACM, V18, P4