NP-HARD SETS AND CREATIVENESS OVER CONSTANT TIME LANGUAGES

被引：0

|

作者：

AGRAWAL, M

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 560卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：224 / 241

页数：18

相关论文

共 50 条

[1] Generalized juntas and NP-hard sets
Erdelyi, Gabor
Hemaspaandra, Lane A.
Rothe, Joerg
Spakowski, Holger
THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3995 - 4000
[2] NP-hard sets are superterse unless NP is small
Wang, YG
INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 1 - 6
[3] NP-Hard sets are exponentially dense unless coNP ⊆ NP/poly
Buhrman, Harry
Hitchcock, John M.
TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 1 - +
[4] CLOSENESS OF NP-HARD SETS TO OTHER COMPLEXITY CLASSES
FU, B
LI, HZ
SIAM JOURNAL ON COMPUTING, 1994, 23 (02) : 255 - 260
[5] GENERATING HARD AND DIVERSE TEST SETS FOR NP-HARD GRAPH PROBLEMS
SANCHIS, LA
DISCRETE APPLIED MATHEMATICS, 1995, 58 (01) : 35 - 66
[6] A Note on Closeness between NP-Hard Sets and C=P
刘田
JournalofComputerScienceandTechnology, 2000, (02) : 194 - 195
[7] Trainyard is NP-Hard
Almanza, Matteo
Leucci, Stefano
Panconesi, Alessandro
THEORETICAL COMPUTER SCIENCE, 2018, 748 : 66 - 76
[8] A note on closeness between NP-Hard sets and C=P
Liu, T
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2000, 15 (02) : 194 - 195
[9] ON SYMMETRICAL DIFFERENCES OF NP-HARD SETS WITH WEAKLY-P-SELECTIVE SETS
FU, B
LI, HZ
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 439 - 448
[10] ON SYMMETRICAL DIFFERENCES OF NP-HARD SETS WITH WEAKLY P-SELECTIVE SETS
FU, B
LI, HZ
THEORETICAL COMPUTER SCIENCE, 1993, 120 (02) : 279 - 291

← 1 2 3 4 5 →