| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427935 | Information Processing Letters | 2008 | 8 Pages |
Abstract
In this paper we study the parameterized complexity of probability amplification for some parameterized probabilistic classes. We prove that it is very unlikely that W[P] has the probability amplification property.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
