Abstract
The class 
is a parameterized analogue of 
. Chen et al. [4] have given a machine characterization of 
. The corresponding machine model gives rise to a parameterized analogue of BPP. What is the connection between parameterized and classical derandomization?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alekhnovich, M., Razborov, A.A.: Resolution is Not Automatizable Unless W[P] is Tractable. In: Proceedings of the 41th IEEE Symposium on Foundations of Computer Science, pp. 210–219 (2001)
Arvind, V., Raman, V.: Approximation Algorithms for Some Parameterized Counting Problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 453–464. Springer, Heidelberg (2002)
Chen, Y., Flum, J.: The Parameterized Complexity of Maximality and Minimality Problems. Annals of Pure and Applied Logic 151(1), 22–61 (2008); In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 22–61. Springer, Heidelberg (2006)
Chen, Y., Flum, J., Grohe, M.: Machine-based methods in parameterized complexity theory. Theoretical Computer Science 339, 167–199 (2005)
Downey, R.G., Fellows, M.R., Regan, K.W.: Parameterized Circuit Complexity and the W Hierarchy. Theoretical Computer Science 191(1–2), 97–115 (1998)
Eickmeyer, K., Grohe, M., Grübner, M.: Approximisation of W[P]-complete minimisation problems is hard. In: 23rd CCC (2008)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Grohe, M.: Communication
Montoya, J.A.: Communication
Müller, M.: Randomized Approximations of Parameterized Counting Problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 50–59. Springer, Heidelberg (2006)
Müller, M.: Valiant-Vazirani Lemmata for Various Logics (manuscript)
Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)
Sloper, C., Telle, J.A.: Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 251–263. Springer, Heidelberg (2006)
Toda, S.: PP is as Hard as the Polynomial Hierarchy. SIAM Journal on Computing 20(5), 865–877 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, M. (2008). Parameterized Derandomization. In: Grohe, M., Niedermeier, R. (eds) Parameterized and Exact Computation. IWPEC 2008. Lecture Notes in Computer Science, vol 5018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79723-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-79723-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79722-7
Online ISBN: 978-3-540-79723-4
eBook Packages: Computer ScienceComputer Science (R0)