TR06-069 | 11th May 2006 00:00
The Complexity of Unions of Disjoint Sets
Abstract:
This paper is motivated by the open question
whether the union of two disjoint NP-complete sets always is
NP-complete. We discover that such unions retain
much of the complexity of their single components. More precisely,
they are complete with respect to more general reducibilities.