451 search results - page 1 / 91 » On Parameterized Exponential Time Complexity |
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
