BOUNDED QUERY MACHINES - ON NP( ) AND NPQUERY( )

被引：25

作者：

BOOK, RV

WRATHALL, C

机构：

来源：

关键词：

D O I：

10.1016/0304-3975(81)90062-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：41 / 50

页数：10

共 15 条

[1] ON COUNTING PROBLEMS AND THE POLYNOMIAL-TIME HIERARCHY [J].

ANGLUIN, D .

[2]

Baker T., 1975, SIAM Journal on Computing, V4, P431, DOI 10.1137/0204037

[3]

Baker T. P., 1979, Theoretical Computer Science, V8, P177, DOI 10.1016/0304-3975(79)90043-4

[4]

BOOK R, UNPUBLISHED

[5] BOUNDED QUERY MACHINES - ON NP AND PSPACE [J].

BOOK, RV .

[6]

BOOK RV, 1979, ACTA INFORM, V12, P177, DOI 10.1007/BF00266049

[7]

GINSBURG S, 1969, STUDIES ABSTRACT FAM, V87, P41

[8]

LADNER R, 1978, THEORET COMPUT SCI, V7, P185

[9]

ROSENKRANTZ D, UNPUBLISHED

[10]

SIMON I, 1977, 9TH P ACM S THEOR CO, P186