359 search results - page 1 / 72 » The Parameterized Complexity of Counting Problems |
APAL
2006
13 years 4 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
TAMC
2007
Springer
13 years 11 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,...
ICALP
2009
Springer
14 years 5 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...
TCS
2010
13 years 3 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...