BOUNDED QUERY MACHINES - ON NP AND PSPACE

被引:27
作者
BOOK, RV
机构
关键词
D O I
10.1016/0304-3975(81)90061-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:27 / 39
页数:13
相关论文
共 17 条
[1]  
Baker T., 1975, SIAM Journal on Computing, V4, P431, DOI 10.1137/0204037
[2]  
Baker T. P., 1979, Theoretical Computer Science, V8, P177, DOI 10.1016/0304-3975(79)90043-4
[3]  
BOOK R, UNPUBLISHED
[4]  
Book R. V., 1978, Theoretical Computer Science, V7, P185, DOI 10.1016/0304-3975(78)90048-8
[5]  
Book R. V., 1970, Journal of Computer and System Sciences, V4, P606, DOI 10.1016/S0022-0000(70)80031-9
[6]  
Book R. V., 1972, SIAM Journal on Computing, V1, P281, DOI 10.1137/0201019
[7]   BOUNDED QUERY MACHINES - ON NP( ) AND NPQUERY( ) [J].
BOOK, RV ;
WRATHALL, C .
THEORETICAL COMPUTER SCIENCE, 1981, 15 (01) :41-50
[8]   POLYNOMIAL SPACE AND TRANSITIVE CLOSURE [J].
BOOK, RV .
SIAM JOURNAL ON COMPUTING, 1979, 8 (03) :434-439
[9]  
BOOK RV, 1979, ACTA INFORM, V12, P177, DOI 10.1007/BF00266049
[10]  
Cook S. A., 1973, Journal of Computer and System Sciences, V7, P343, DOI 10.1016/S0022-0000(73)80028-5