STORAGE REQUIREMENTS FOR DETERMINISTIC POLYNOMIAL TIME RECOGNIZABLE LANGUAGES

被引：40

作者：

COOK, S

SETHI, R

机构：

[1] UNIV TORONTO,TORONTO,ONTARIO,CANADA

[2] PENN STATE UNIV,UNIVERSITY PK,PA 16802

来源：

关键词：

D O I：

10.1016/S0022-0000(76)80048-7

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：25 / 37

页数：13

共 9 条

[1] COMPARING COMPLEXITY CLASSES [J].

BOOK, RV .

[2] OBSERVATION ON TIME-STORAGE TRADE OFF [J].

COOK, SA .

[3] SERIAL COMPILATION AND THE 1401-FORTRAN COMPILER [J].

HAINES, LH .

[4]

JONES ND, 1974, 6TH P ANN ACM S THEO, P40

[5]

LEWIS PM, 1965, IEEE C RECORD SWITCH, P191

[6]

Sethi R., 1975, SIAM Journal on Computing, V4, P226, DOI 10.1137/0204020

[7]

Walker S. A., 1973, Journal of Computer and System Sciences, V7, P404, DOI 10.1016/S0022-0000(73)80032-7

[8] RECOGNITION AND PARSING OF CONTEXT-FREE LANGUAGES IN TIME N3 [J].

YOUNGER, DH .

INFORMATION AND CONTROL, 1967, 10 (02) :189-&

[9]

[No title captured]