The Complexity of Unions of Disjoint Sets

This paper is motivated by the open question whether the union of two disjoint NPcomplete 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. Moreover, we approach the main question in a more general way: We analyze the scope of the complexity of unions of m-equivalent disjoint sets. Under the hypothesis that NE = coNE, we construct degrees in NP where our main question has a positive answer, i.e., these degrees are closed under unions of disjoint sets.

• Type: Conference
• Year: 2007
• Where: STACS
• Authors: Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
• Keywords: Disjoint Npcomplete Sets, Disjoint Sets, Main Question, STACS 2007, Theoretical Computer Science