9842 search results - page 21 / 1969 » Problem complexity |
DM
2010
13 years 7 months ago
2010
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we ...
PAMI
2002
13 years 7 months ago
2002
GD
2009
Springer
13 years 11 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...