Article contents
On the parameterized complexity of approximate counting
Published online by Cambridge University Press: 18 April 2011
Abstract
In this paper we study the parameterized complexity of approximating the
parameterized counting problems contained in the class $\#W[P]$,
the parameterized analogue of $\#P$
. We prove a parameterized analogue of a
famous theorem of Stockmeyer claiming that approximate counting belongs to
the second level of the polynomial hierarchy.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2011
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045824077-0487:S0988375411000075:S0988375411000075_eqnU3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045824077-0487:S0988375411000075:S0988375411000075_eqnU4.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045824077-0487:S0988375411000075:S0988375411000075_eqnU5.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045824077-0487:S0988375411000075:S0988375411000075_eqnU6.gif?pub-status=live)
- 2
- Cited by