Parameterized derandomization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5018 LNCS, Issue , 2008, Pages 148-159

  Müller, Moritz ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PARAMETERIZATION;

DERANDOMIZATION; PARAMETERIZED ANALOGUE;

COMPUTATIONAL COMPLEXITY;

EID: 44649177778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79723-4_15     Document Type: Conference Paper

References (14)

1. 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)
2. 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)
3. 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)
4. Chen, Y., Flum, J., Grohe, M.: Machine-based methods in parameterized complexity theory. Theoretical Computer Science 339, 167-199 (2005)
5. 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)
6. Eickmeyer, K., Grohe, M., Grübner, M.: Approximisation of W[P]-complete minimisation problems is hard. In: 23rd CCC (2008)
7. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
8. Grohe, M.: Communication
9. Montoya, J.A.: Communication
10. 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)
11. Müller, M.: Valiant-Vazirani Lemmata for Various Logics (manuscript)
12. Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)
13. 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)
14. Toda, S.: PP is as Hard as the Polynomial Hierarchy. SIAM Journal on Computing 20(5), 865-877 (1991)