SPACE-BOUNDED REDUCIBILITY AMONG COMBINATORIAL PROBLEMS

被引:185
作者
JONES, ND [1 ]
机构
[1] UNIV KANSAS,COMP SCI DEPT,LAWRENCE,KS 66045
关键词
D O I
10.1016/S0022-0000(75)80050-X
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:68 / 85
页数:18
相关论文
共 13 条
[1]  
BENNETT JH, 1962, THESIS PRINCETON U
[2]  
COOK SA, 1971, 3RD ACM S THEOR COMP, P161
[3]  
Hopcroft J.E., 1969, FORMAL LANGUAGES THE
[4]  
HUNT HB, 1973, 5TH ACM S THEOR COMP
[5]  
JONES ND, 1973, COMPUTABILITY THEORY
[6]  
Karp R. M., 1972, COMPLEXITY COMPUTER
[7]  
MEYER A, 1972, 13TH P ANN IEEE S SW, P125, DOI DOI 10.1109/SWAT.1972.29
[8]  
Myhill J., 1957, TR57624 WADD, V112, P137
[9]  
PFLEEGER C, 1973, IEEE T ELECTRONIC CO, V23, P1099
[10]  
Savitch W. J., 1970, J COMPUT SYSTEM SCI, V4, P177, DOI [10.1016/S0022-0000(70)80006-X, DOI 10.1016/S0022-0000(70)80006-X]