Reducibility classes of P-selective sets

被引：0

|

作者：

Univ of Rochester, Rochester, United States ^{[1
]}

机构：

来源：

Theor Comput Sci | / 2卷 / 447-457期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] Reducibility classes of P-selective sets
Hemaspaandra, LA
Hoene, A
Ogihara, M
THEORETICAL COMPUTER SCIENCE, 1996, 155 (02) : 447 - 457
[2] Reducibility classes of P-selective sets (vol 155, pg 447, 1996)
Hemaspaandra, L
Hoene, A
Ogihara, M
THEORETICAL COMPUTER SCIENCE, 2000, 234 (1-2) : 323 - 323
[3] ON POLYNOMIAL-TIME TRUTH-TABLE REDUCIBILITY OF INTRACTABLE SETS TO P-SELECTIVE SETS
TODA, S
MATHEMATICAL SYSTEMS THEORY, 1991, 24 (02): : 69 - 82
[4] P-selective sets and reducing search to decision vs self-reducibility
Hemaspaandra, E
Naik, AV
Ogihara, M
Selman, AL
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 53 (02) : 194 - 209
[5] On sets turing reducible to p-selective sets
Burtschick H.-J.
Lindner W.
Theory of Computing Systems, 1997, 30 (2) : 135 - 143
[6] REDUCTIONS ON NP AND P-SELECTIVE SETS
SELMAN, AL
THEORETICAL COMPUTER SCIENCE, 1982, 19 (03) : 287 - 304
[7] On sets turing reducible to p-selective sets
Burtschick, HJ
Lindner, W
THEORY OF COMPUTING SYSTEMS, 1997, 30 (02) : 135 - 143
[8] A NOTE ON P-SELECTIVE SETS AND CLOSENESS
RAO, RPN
INFORMATION PROCESSING LETTERS, 1995, 54 (03) : 179 - 185
[9] On sets bounded truth-table reducible to P-selective sets
Thierauf, T
Toda, S
Watanabe, O
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1996, 30 (02): : 135 - 154
[10] Adaptive versus nonadaptive queries to NP and P-selective sets
Naik, AV
Selman, AL
COMPUTATIONAL COMPLEXITY, 1999, 8 (02) : 169 - 187

← 1 2 3 4 5 →