Randomized approximations of parameterized counting problems

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

Volumn 4169 LNCS, Issue , 2006, Pages 50-59

  Müler, Moritz ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; RANDOMIZED APPROXIMATIONS;

RANDOM PROCESSES;

EID: 33750275335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. V.Arvind and V.Raman, Approximation Algorithms for Some Parameterized Counting Problems. In I.Bose and P.Morin, ed., Proceedings of the 13th Annual International Symposium on Algorithms and Computation, LNCS 2518, pp. 453-464. Springer, 2002.
2. Y.Chen, J.Flum and M.Grohe, Machine-Based Methods in Parameterized Complexity Theory, Theoretical Computer Science 339, pp. 167-199, 2005.
3. R.G.Downey and M.R.Fellows, Parameterized Complexity. Springer, 1999.
4. R.G.Downey, M.R.Fellows ans K.W.Regan, Parameterized Circuit Complexity and the W Hierachy, Theoretical Computer Science 191(1-2), pp. 97-115, 1998.
5. J.Flum and M.Grohe, The Parameterized Complexity of Counting Problems. SIAM Journal on Computing 33(4), pp. 892-922, 2004.
6. J.Flum and M.Grohe, Parameterized Complexity Theory. Springer, 2006.
7. O.Goldreich, Randomized Methods in Computation - Lecture Notes, 2001. http://www.wisdom.weizmann.ac.il/~oded/homepage.html
8. M.Jerrum, Counting, Sampling and Intergrating: Algorithms and Complexity. Birkhäuser, 2003.
9. D.S.Johnson, C.H.Papadimitriou and M.Yannakakis, On Generating All Maximal Independent Sets, Information Processing Letters 27, pp. 119-123, 1988.
10. M.Luby and A.Wigderson, Pairwise Independence and Derandomization, International Computer Science Institute, TR-95-035, 1995.
11. C.H.Papadimitriou, Computational Complexity. Addison Wesley, 1994.
12. L.Stockmeyer, On Approximation Algorithms for #P, SIAM Journal on Computing 14(4), pp. 849-861, 1985.
13. S.Toda, PP is as Hard as the Polynomial Hierarchy, SIAM Journal on Computing 20(5), pp. 865-877, 1991.
14. L.G.Valiant, The Complexity of Enumeration and Reliability Problems, SIAM Journal on Computing 8(3), pp. 410-421, 1979.