4860 search results - page 92 / 972 » SNPs Problems, Complexity, and Algorithms |
JSC
2010
13 years 6 months ago
2010
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eï...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
DAM
2006
13 years 7 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
ALGORITHMICA
2002
13 years 7 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...