COMPARING COMPLEXITY CLASSES

被引:24
作者
BOOK, RV [1 ]
机构
[1] HARVARD UNIV,CTR RES COMP TECHNOL,CAMBRIDGE,MA 02138
关键词
D O I
10.1016/S0022-0000(74)80008-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:213 / 229
页数:17
相关论文
共 23 条
[1]  
[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[2]  
Book R. V., 1970, Journal of Computer and System Sciences, V4, P622, DOI 10.1016/S0022-0000(70)80032-0
[3]  
Book R. V., 1970, Journal of Computer and System Sciences, V4, P606, DOI 10.1016/S0022-0000(70)80031-9
[4]  
Book R. V., 1972, SIAM Journal on Computing, V1, P281, DOI 10.1137/0201019
[5]   AFLS AND BOUNDED ERASING [J].
BOOK, RV ;
WEGBREIT, B .
INFORMATION AND CONTROL, 1971, 19 (01) :18-&
[6]  
BOOK RV, 1970, MATH SYST THEORY, V4, P97
[7]  
Borodin A. B., 1973, CURRENTS THEORY COMP, P35
[8]  
COBHAM A, 1964, 1964 P INT C LOG MET, P24
[9]  
Cook S. A., 1973, Journal of Computer and System Sciences, V7, P343, DOI 10.1016/S0022-0000(73)80028-5
[10]   CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J].
COOK, SA .
JOURNAL OF THE ACM, 1971, 18 (01) :4-&