On generating all maximal independent sets
Information Processing Letters
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Parameterized circuit complexity and the W hierarchy
Theoretical Computer Science
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Pairwise Independence and Derandomization
Pairwise Independence and Derandomization
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Machine-based methods in parameterized complexity theory
Theoretical Computer Science
Parameterized Complexity
The parameterized complexity of probability amplification
Information Processing Letters
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
We prove that each parameterized counting problem in the class #[P] has a randomized fpt approximation algorithm using a W[P] oracle. Analoguous statements hold for #W[t] and #A[t] for each t≥1. These results are parameterized analogues of a theorem due to O.Goldreich and L.Stockmeyer.