Unions of Disjoint NP-Complete Sets

We study the following question: if <i>A</i> and <i>B</i> are disjoint NP-complete sets, then is <i>A</i> ∪ <i>B</i> NP-complete? We provide necessary and sufficient conditions under which the union of disjoint NP-complete sets remain complete.

[1]  Christian Glaßer,et al.  The Complexity of Unions of Disjoint Sets , 2007, STACS.

[2]  Arnold L. Rosenberg,et al.  Theoretical Computer Science, Essays in Memory of Shimon Even , 2006, Essays in Memory of Shimon Even.

[3]  Rahul Santhanam.  Circuit lower bounds for Merlin-Arthur classes , 2007, STOC '07.

[4]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[5]  Christian Glaßer,et al.  Properties of NP-Complete Sets , 2006, SIAM J. Comput..

[6]  Christian Glaßer,et al.  Reductions between disjoint NP-pairs , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[7]  Christian Glaßer,et al.  The complexity of unions of disjoint sets , 2008, J. Comput. Syst. Sci..

[8]  Avi Wigderson,et al.  Randomness vs Time: Derandomization under a Uniform Assumption , 2001, J. Comput. Syst. Sci..

[9]  Valentine Kabanets,et al.  Easiness assumptions and hardness tests: trading time for zero error , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[10]  Christian Glaßer,et al.  Unions of Disjoint NP-Complete Sets , 2011, COCOON.

[11]  Juris Hartmanis,et al.  On isomorphisms and density of NP and other complete sets , 1976, STOC '76.

[12]  Avi Wigderson,et al.  Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  Christian Glaßer,et al.  Splitting NP-Complete Sets , 2008, SIAM J. Comput..

[14]  Manindra Agrawal,et al.  Pseudo-random generators and structure of complete degrees , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[15]  Lance Fortnow,et al.  Inseparability and Strong Hypotheses for Disjoint NP Pairs , 2009, Theory of Computing Systems.

[16]  Christian Glaßer,et al.  Canonical disjoint NP-pairs of propositional proof systems , 2005, Theor. Comput. Sci..

[17]  Alan L. Selman.  Natural Self-Reducible Sets , 1988, SIAM J. Comput..

[18]  Rocco A. Servedio,et al.  On Learning Random DNF Formulas Under the Uniform Distribution , 2005, Theory Comput..

[19]  Pavel Pudlák,et al.  On reducibility and symmetry of disjoint NP pairs , 2003, Theor. Comput. Sci..

[20]  Oded Goldreich,et al.  On Promise Problems: A Survey , 2006, Essays in Memory of Shimon Even.

[21]  Alexander A. Razborov,et al.  On provably disjoint NP-pairs , 1994, Electron. Colloquium Comput. Complex..

[22]  Christian Glaßer,et al.  Properties of NP-complete sets , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[23]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[24]  Christian Glaßer,et al.  Canonical disjoint NP-pairs of propositional proof systems , 2007, Theor. Comput. Sci..

[25]  Valentine Kabanets.  Easiness Assumptions and Hardness Tests: Trading Time for Zero Error , 2001, J. Comput. Syst. Sci..

[26]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..