The parameterized complexity of probability amplification

Information Processing Letters

Volumn 109, Issue 1, 2008, Pages 46-53

  Montoya, J Andrés ^a  

^a UNIVERSIDAD INDUSTRIAL DE SANTANDER   (Colombia)

Author keywords

Computational complexity; Parameterized complexity; Probabilistic classes; Probability amplification

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBABILITY; RANDOM PROCESSES;

PARAMETERIZED; PARAMETERIZED COMPLEXITIES; PARAMETERIZED COMPLEXITY; PROBABILISTIC CLASSES;

AMPLIFICATION;

EID: 55149106752     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.06.007     Document Type: Article

References (13)

1. M. Alekhnovich, A. Razborov, Resolution is not automatizable unless W [P] is tractable, in: Proceedings 42nd IEEE FOCS, 2001, pp. 210-219
2. Arvind V., and Raman V. Approximation algorithms for some parameterized counting problems. In: Bose P., and Morin P. (Eds). Proceedings of the 13th Annual International Symposium on Algorithms and Computation. Lecture Notes in Computer Science vol. 2518 (2002), Springer-Verlag 453-464
3. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag
4. Downey R.G., Fellows M., and Regan K. Parameterized circuit complexity and the W hierarchy. Theoretical Computer Sciences 191 (1998) 97-115
5. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer-Verlag
6. Flum J., and Grohe M. The parameterized complexity of counting problems. SIAM Journal of Computing 33 4 (2004) 892-922
7. Goldreich O. Randomized methods in computation. Manuscript (2001). http://www.wisdom.weizmann.ac.il/~oded/rnd.html
8. McCartin C. Parameterized counting problems. In: Diks K., and Rytter W. (Eds). Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science Logic. Lecture Notes in Computer Science vol. 2420 (2002), Springer-Verlag 556-567
9. Muller M. Randomized approximations of parameterized counting problems. Proceedings 2nd IWPEC. Lecture Notes in Computer Science vol. 4169 (2006), Springer-Verlag 50-59
10. Stockmeyer L. On approximation algorithms for #P. SIAM Journal on Computing 14 4 (1985) 849-861
11. Toda S. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20 5 (1991) 865-877
12. Valiant L.G. The complexity of computing the permanent. Theoretical Computer Science 8 (1979) 189-201
13. Valiant L.G. The complexity of enumeration and reliability problems. SIAM Journal on Computing 8 3 (1979) 410-421