Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

On the parameterized complexity of approximate counting

J. Andrés Montoya — 2011

RAIRO - Theoretical Informatics and Applications

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.

On the parameterized complexity of approximate counting

J. Andrés Montoya — 2011

RAIRO - Theoretical Informatics and Applications

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.

Page 1

Download Results (CSV)