PROBLEMS COMPLETE FOR DETERMINISTIC LOGARITHMIC SPACE

被引：98

作者：

COOK, SA

MCKENZIE, P

机构：

[1] UNIV TORONTO,DEPT COMP SCI,TORONTO M5S 1A4,ONTARIO,CANADA

[2] UNIV MONTREAL,DEPT INFORMAT & RECH OPERAT,MONTREAL H3C 3J7,QUEBEC,CANADA

来源：

关键词：

D O I：

10.1016/0196-6774(87)90018-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：385 / 394

页数：10

共 15 条

[1]

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

[2]

BARRINGTON D, 1986, 18TH P ACM STOC, P1

[3] RELATING TIME AND SPACE TO SIZE AND DEPTH [J].

BORODIN, A .

[4] A TAXONOMY OF PROBLEMS WITH FAST PARALLEL ALGORITHMS [J].

COOK, SA .

INFORMATION AND CONTROL, 1985, 64 (1-3) :2-22

[5]

COOK SA, 1981, ENSEIGNEMENT MATH 2, V27

[6]

FISHER M, 1974, MJ FISHER LECTURE NO

[7]

Hartmanis J., 1978, 19th Annual Symposium on Foundations of Computer Science, P65, DOI 10.1109/SFCS.1978.31

[8]

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

[9]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[10] SPACE-BOUNDED REDUCIBILITY AMONG COMBINATORIAL PROBLEMS [J].

JONES, ND .