Some Hard Families of Parameterized Counting Problems
نویسندگان
چکیده
منابع مشابه
Some hard families of parameterised counting problems
We consider parameterised subgraph-counting problems of the following form: given a graph G, how many k-tuples of its vertices have a given property? A number of such problems are known to be #W[1]complete; here we substantially generalise some of these existing results by proving hardness for two large families of such problems. We demonstrate that it is #W[1]-hard to count the number of k-ver...
متن کاملParameterized Counting Problems
Parameterized complexity has so far been largely con ned to consideration of computational problems as decision or search prob lems However it is becoming evident that the parameterized point of view can lead to new insight into counting problems The goal of this article is to introduce a formal framework in which one may consider parameterized counting problems
متن کاملKernelizations for Parameterized Counting Problems
Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems, to wit, counting kernelizations which turn out to be equivalent to the fixed parameter tractability of counting problems. Furthermore, we study the application of well-known kernelization techniques to counting problems. Among ...
متن کاملPhase Transitions in Planning Problems: Design and Analysis of Parameterized Families of Hard Planning Problems
There are two common ways to evaluate algorithms: performance on benchmark problems derived from real applications and analysis of performance on parametrized families of problems. The two approaches complement each other, each having its advantages and disadvantages. The planning community has concentrated on the first approach, with few ways of generating parametrized families of hard problem...
متن کاملThe Parameterized Complexity of Counting Problems
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W[t], for t ≥ 1, that corresponds to Downey and Fellows’s W-hierarchy [13] and show that a few central W-completeness results for decision problems translate to #W-completeness results for the corresponding counting problems. Cou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2015
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2786017