Affiliation:
1. Julius-Maximilians-Universität Würzburg
2. University Wyoming
3. Iowa State University
Abstract
We study the following question: if
A
and
B
are disjoint NP-complete sets, then is
A
∪
B
NP-complete? We provide necessary and sufficient conditions under which the union of disjoint NP-complete sets remain complete.
Funder
National Science Foundation
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Theory and Mathematics,Theoretical Computer Science