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
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
The parameterized complexity of maximality and minimality problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Randomized approximations of parameterized counting problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
The class W[P] is a parameterized analogue of NP. Chen etal. [4] have given a machine characterization of W[P]. The correspondingmachine model gives rise to a parameterized analogue of BPP. What isthe connection between parameterized and classical derandomization?