Separation of NP-Completeness Notions

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 ≤P T -complete but not ≤P tt -complete. We provide fairly thorough analyses of the hypotheses that we introduce.

• Type: Conference
• Year: 2001
• Where: COCO
• Authors: Aduri Pavan, Alan L. Selman
• Keywords: Algorithms, COCO 2001, Hypotheses, Structural Complexity Theory, Various Np-completeness Notions