Parameterized Derandomization

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?

[1]  Yijia Chen,et al.  The Parameterized Complexity of Maximality and Minimality Problems , 2006, IWPEC.

[2]  Venkatesh Raman,et al.  Approximation Algorithms for Some Parameterized Counting Problems , 2002, ISAAC.

[3]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[4]  Kord Eickmeyer,et al.  Approximation of Natural W[P]-Complete Minimisation Problems Is Hard , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[5]  Michael A. Langston,et al.  Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.

[6]  Michael R. Fellows,et al.  Parameterized Circuit Complexity and the W Hierarchy , 1998, Theor. Comput. Sci..

[7]  Yijia Chen,et al.  Machine-based methods in parameterized complexity theory , 2005, Theor. Comput. Sci..

[8]  Moritz Müller.  Valiant-Vazirani Lemmata for Various Logics , 2008, Electron. Colloquium Comput. Complex..

[9]  Moritz Müller.  Randomized Approximations of Parameterized Counting Problems , 2006, IWPEC.

[10]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[11]  Michael Alekhnovich,et al.  Resolution is not automatizable unless W[P] is tractable , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Jan Arne Telle,et al.  Towards a Taxonomy of Techniques for Designing Parameterized Algorithms , 2006, IWPEC.

[13]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..