4218 search results - page 26 / 844 » Complete sets of cooperations |
IPL
2007
13 years 7 months ago
2007
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper we evaluate outage performance of a cooperative transmission protocol over fading channels that requires a number of relaying nodes to employ a distributed space-...
DM
1999
13 years 7 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
ORL
2008
13 years 7 months ago
2008
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...