论文信息 - Bi-Immunity Separates Strong NP-Completeness Notions

Bi-Immunity Separates Strong NP-Completeness Notions

We prove that if for some ? > 0, NP contains a set that is DTIME(2n?)-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-truth-table complete for NP. Thus this hypothesis implies a strong separation of completeness notions for NP. Lutz and Mayordomo [LM96] and Ambos-Spies and Bentzien [ASB00] previously obtained the same consequence using strong hypotheses involving resource-bounded measure and/or category theory. Our hypothesis is weaker and involves no assumptions about stochastic properties of NP.

Aduri Pavan | Alan L. Selman

[1] Sebastiaan Terwijn,et al. Resource Bounded Randomness and Weakly Complete Problems , 1997, Theor. Comput. Sci..

[2] Klaus Ambos-Spies,et al. Separating NP-Completeness Notions under Strong Hypotheses , 2000, J. Comput. Syst. Sci..

[3] Luc Longpré,et al. Cook Reducibility is Faster than Karp Reduciblity in NP , 1990, J. Comput. Syst. Sci..

[4] John Gill,et al. Polynomial reducibilities and upward diagonalizations , 1977, STOC '77.

[5] José L. Balcázar,et al. Structural complexity 2 , 1990 .

[6] R.E. Ladner,et al. A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[7] Alan L. Selman,et al. Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..

[8] José L. Balcázar,et al. Structural Complexity II , 2012, EATCS.

[9] Donald B. Johnson,et al. Lower Bounds for Selection in X + Y and Other Multisets , 1978, JACM.

[10] Jack H. Lutz,et al. Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small , 1996, Theor. Comput. Sci..

[11] Aduri Pavan,et al. Separation of NP-Completeness Notions , 2001, SIAM J. Comput..