A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Fixed-Parameter Perspective on #BIS * † theorem numbering here matches the full version
2017
licensed under Creative Commons License CC-BY 12th International Symposium on Parameterized and Exact Computation
unpublished
The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class #RHΠ 1. It is believed that #BIS does not have an efficient approximation algorithm but also that it is not NP-hard. We study the robustness of the intermediate complexity of #BIS by considering variants of the problem parameterised by the size of the independent set. We map the complexity landscape for three
fatcat:wpldwkzd4befxnuxxkp6alzwfi