451 search results - page 16 / 91 » On Parameterized Exponential Time Complexity |
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
SCL
2010
13 years 8 months ago
2010
We deal with dynamic equations on time scales, where we characterize the positivity of a system. Uniform exponential stability of a system is determined by the spectrum of its mat...
TAMC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
COCO
1998
Springer
14 years 2 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...