172 search results - page 5 / 35 » The Complexity of Unions of Disjoint Sets |
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider the problem of minimizing the size of a set system G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and...
MLQ
1998
13 years 7 months ago
1998
Abstract. We investigate the set theoretical strength of some properties of normality, including Urysohn’s Lemma, Tietze-Urysohn Extension Theorem, normality of disjoint unions o...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...