On parameterized counting
In this work we have tried to prove that parameterized exact counting is very hard and that parameterized approximate counting is almost tractable. To this end, we have looked for parameterized analogues of the theorems of Toda and Stockmeyer. By the way we have discovered that the main difficulty c...
|QR Code:||Show QR Code|