139
Voted
STACS
2010
Springer
16 years 14 days 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...