359 search results - page 22 / 72 » The Parameterized Complexity of Counting Problems |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
LATA
2010
Springer
14 years 20 days ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
SIAMCOMP
2008
13 years 7 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...