3 search results - page 1 / 1 » Inseparability and Strong Hypotheses for Disjoint NP Pairs |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....