10997 search results - page 51 / 2200 » On the Structure of Complete Sets |
148
Voted
IPL
2007
15 years 5 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] ...
124
Voted
DM
1999
15 years 5 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...
161
click to vote
ORL
2008
15 years 5 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...
154
Voted
STACS
2010
Springer
16 years 9 days 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...
189
click to vote
JAPLL
2010
15 years 4 months ago
2010
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...