Skip to main content
Conference Proceedings

Unions of disjoint NP-complete sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6842 LNCS 240-251
DOI: 10.1007/978-3-642-22685-4_22
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Glaßer, C., Hitchcock, J. M., Pavan, A., & Travers, S. (2011). Unions of disjoint NP-complete sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6842 LNCS, pp. 240–251). https://doi.org/10.1007/978-3-642-22685-4_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free