52 search results - page 1 / 11 » Sharp Separation and Applications to Exact and Parameterized... |
LATIN
2010
Springer
14 years 6 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
ALGORITHMICA
2002
13 years 11 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...
FCT
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...