3172 search results - page 17 / 635 » On the Random-Self-Reducibility of Complete Sets |
SIAMMAX
2010
13 years 4 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
LATA
2009
Springer
14 years 4 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
GD
2004
Springer
14 years 3 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
COMBINATORICA
2007
13 years 9 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...