| Issue |
RAIRO-Theor. Inf. Appl.
Volume 45, Number 2, April-June 2011
|
|
|---|---|---|
| Page(s) | 197 - 223 | |
| DOI | https://doi.org/10.1051/ita/2011007 | |
| Published online | 18 April 2011 | |
On the parameterized complexity of approximate counting
Escuela de Matemáticas, Universidad industrial de Santander, Spain;
amontoyaa@googlemail.com; juamonto@uis.edu.co
Received:
7
April
2008
Accepted:
1
February
2011
In this paper we study the parameterized complexity of approximating the
parameterized counting problems contained in the class 
,
the parameterized analogue of 
. We prove a parameterized analogue of a
famous theorem of Stockmeyer claiming that approximate counting belongs to
the second level of the polynomial hierarchy.
Mathematics Subject Classification: 68Q15 / 68Q17
Key words: Computational complexity / parameterized complexity / counting problems / approximate counting
© EDP Sciences, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.