Sciweavers

COCO
2001
Springer
102views Algorithms» more  COCO 2001»
14 years 4 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...
Aduri Pavan, Alan L. Selman