Sciweavers

Share
COCO
2001
Springer

Separation of NP-Completeness Notions

10 years 2 months ago
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.
Aduri Pavan, Alan L. Selman
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where COCO
Authors Aduri Pavan, Alan L. Selman
Comments (0)
books