The Complexity of Unions of Disjoint Sets
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.
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.
KeywordsChromatic Number SIAM Journal Polynomial Hierarchy Mathematical System Theory Polynomial Time Reducibility
Unable to display preview. Download preview PDF.
- [Agr02]Agrawal, M.: Pseudo-random generators and structure of complete degrees. In: IEEE Conference on Computational Complexity, pp. 139–147. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
- [AS84]Ambos-Spies, K.: P-mitotic sets. In: Börger, E., Rödding, D., Hasenjaeger, G. (eds.) Rekursive Kombinatorik 1983. LNCS, vol. 171, pp. 1–23. Springer, Heidelberg (1984)Google Scholar
- [BV97]Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: SODA, pp. 675–681 (1997)Google Scholar
- [KS97]Köbler, J., Schöning, U.: High sets for NP. In: Advances in Algorithms, Languages, and Complexity, pp. 139–156 (1997)Google Scholar
- [Lon78]Long, T.J.: On some Polynomial Time Reducibilities. PhD thesis, Purdue University, Lafayette, Ind. (1978)Google Scholar
- [WW85]Wagner, K.W., Wechsung, G.: On the boolean closure of NP. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 485–493. Springer, Heidelberg (1985)Google Scholar