Separation of NP-Completeness Notions

Authors:
A. Pavan;Alan L. Selman
Affiliations:
-;-
Venue:
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Year:
2001

Citing 0
Cited 1

Bi-Immunity Separates Strong NP-Completeness Notions

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is \leq^P_T-complete but not \leq^P_{tt}-complete. We provide fairly thorough analyses of the hypotheses that we introduce.