Sciweavers

COCO
1995
Springer
113views Algorithms» more  COCO 1995»
13 years 8 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
13 years 8 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