ON SOME DETERMINISTIC SPACE COMPLEXITY PROBLEMS

被引：8

作者：

HONG, JW ^{[1
]}

机构：

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

来源：

关键词：

D O I：

10.1137/0211050

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：591 / 601

页数：11

共 9 条

[1]

Aho AV., 1975, DESIGN ANAL COMPUTER

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

BORODIN, A .

[3] SPACE LOWER BOUNDS FOR MAZE THREADABILITY ON RESTRICTED MACHINES [J].

COOK, SA ;

RACKOFF, CW .

[4]

COOK SA, 1980, INT S LOGIK ALGORITH

[5]

FERRANTE J, 1979, LECTURE NOTES MATH, V718

[6]

Hopcroft J.E., 1969, FORMAL LANGUAGES THE

[7]

HUNT HB, 1973, TR73156 CORN U DEP C

[8]

MEYER AR, 13TH P IEEE S SWITCH, P125

[9]

Stockmeyer Larry Joseph, 1974, COMPLEXITY DECISION