Blar i Department of Informatics på emneord "Parameterised complexity"
Viser treff 1-1 av 1
-
A Fixed-Parameter Perspective on #BIS
(Peer reviewed; Journal article, 2019-07-18)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 ...