The complexity of unions of disjoint sets

Authors:
Christian Glaßer;Alan L. Selman;Stephen Travers;Klaus W. Wagner
Affiliations:
Julius-Maximilians-Universität Würzburg, Institut für Informatik, Am Hubland, Würzburg, Germany;University at Buffalo, USA;Julius-Maximilians-Universität Würzburg, Institut für Informatik, Am Hubland, Würzburg, Germany;Julius-Maximilians-Universität Würzburg, Institut für Informatik, Am Hubland, Würzburg, Germany
Venue:
Journal of Computer and System Sciences
Year:
2008

Citing 16
Cited 2

Nondeterministic turing machines with modified acceptance

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Complexity measures for public-key cryptosystems

SIAM Journal on Computing - Special issue on cryptography
The Boolean hierarchy I: structural properties

SIAM Journal on Computing
Natural self-reducible sets

SIAM Journal on Computing
Splittings, Robustness, and Structure of Complete Sets

SIAM Journal on Computing
Rounding in lattices and its cryptographic applications

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the Boolean closure of NP

FCT '85 Fundamentals of Computation Theory
P-mitotic sets

Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Uniformly hard languages

Theoretical Computer Science - Australasian computer science
Pseudo-Random Generators and Structure of Complete Degrees

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
On some polynomial time reducibilities.

On some polynomial time reducibilities.
Separability and one-way functions

Computational Complexity
Redundancy in complete sets

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Comparing reductions to NP-complete sets

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Machines that can output empty words

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the Shannon capacity of a graph

IEEE Transactions on Information Theory

Unions of disjoint NP-complete sets

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Unions of Disjoint NP-Complete Sets

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 NEcoNE, we construct degrees in NP where our main question has a positive answer, i.e., these degrees are closed under unions of disjoint sets.