359 search results - page 20 / 72 » The Parameterized Complexity of Counting Problems |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
COCO
1998
Springer
13 years 11 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
IWPEC
2004
Springer
14 years 28 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...