# A Fixed-Parameter Perspective on #BIS

@inproceedings{Curticapean2017AFP, title={A Fixed-Parameter Perspective on #BIS}, author={Radu Curticapean and Holger Dell and Fedor V. Fomin and Leslie Ann Goldberg and John Lapinskas}, booktitle={IPEC}, year={2017} }

- Published 2017 in IPEC
DOI:10.4230/LIPIcs.IPEC.2017.13

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… CONTINUE READING