986 search results - page 2 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
COCO
2004
Springer
13 years 8 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
BMCBI
2006
13 years 5 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
SODA
2010
ACM
13 years 3 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
ISPAN
2002
IEEE
13 years 10 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...