ON SYMMETRICAL DIFFERENCES OF NP-HARD SETS WITH WEAKLY-P-SELECTIVE SETS

被引:0
|
作者
FU, B
LI, HZ
机构
[1] UNIV SCI & TECHNOL CHINA, BEIJING LAB COGNIT SCI, HEFEI, PEOPLES R CHINA
[2] YUNNAN EDUC COLL, DEPT MATH, KUNMING 650031, PEOPLES R CHINA
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The symmetric differences of NP - hard sets with weakly -P - selective sets are investigated in this paper. We show that if there exist a weakly-P-selective set A and a NP- less-than-or-equal-to m(P) -hard set H such that H - A is-an-element-of P(btt) (Sparse) and A - H is-an-element-of P(m) (Sparse) then P = NP So no NP- less-than-or-equal-to m(P) -hard set has sparse symmetric difference with any weakly -P - selective set unless P = NP. In addition we show there exists a P-selective set which has exponentially dense symmetric difference with every set in P(btt)(Sparse).
引用
收藏
页码:439 / 448
页数:10
相关论文
共 47 条
  • [21] On sets turing reducible to p-selective sets
    Burtschick, HJ
    Lindner, W
    THEORY OF COMPUTING SYSTEMS, 1997, 30 (02) : 135 - 143
  • [22] Solving NP-hard problems on GATEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets
    Hellmuth, Marc
    Scholz, Guillaume E.
    THEORETICAL COMPUTER SCIENCE, 2024, 1037
  • [23] SPARSE SETS IN NP-P - RELATIVIZATIONS
    KURTZ, SA
    SIAM JOURNAL ON COMPUTING, 1985, 14 (01) : 113 - 119
  • [24] Implementation of Kernel P Systems in CUDA for Solving NP-hard Problems
    Fan, Songhai
    Gong, Yiyu
    Zhang, Gexiang
    Xiao, Yun
    Rong, Haina
    Paul, Prithwineel
    Ma, Xiaomin
    Huang, Han
    Gheorghe, Marian
    INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, 2021, 16 (2-3) : 259 - 278
  • [25] P-SELECTIVE SETS, TALLY LANGUAGES, AND THE BEHAVIOR OF POLYNOMIAL TIME REDUCIBILITIES ON NP
    SELMAN, AL
    MATHEMATICAL SYSTEMS THEORY, 1979, 13 (01): : 55 - 65
  • [26] SHOOTING A DENSE SET THROUGH P-NP SETS
    NOURANI, CF
    JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (04) : 1100 - 1100
  • [27] SPARSE SETS IN NP-P - EXPTIME VERSUS NEXPTIME
    HARTMANIS, J
    IMMERMAN, N
    SEWELSON, V
    INFORMATION AND CONTROL, 1985, 65 (2-3): : 158 - 181
  • [28] 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
  • [29] Sparse hard sets for P: Resolution of a conjecture of Hartmanis
    Cai, JY
    Sivakumar, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (02) : 280 - 296
  • [30] A NOTE ON P-SELECTIVE SETS AND CLOSENESS
    RAO, RPN
    INFORMATION PROCESSING LETTERS, 1995, 54 (03) : 179 - 185