31 search results - page 1 / 7 » On Parameterized Intractability: Hardness and Completeness |
CJ
2008
13 years 5 months ago
2008
AAAI
2008
13 years 7 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
SIAMCOMP
2010
12 years 11 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
MST
2006
13 years 4 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...