31 citations · 62 across the 15 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 6 cited
Fine-grained reductions from approximate counting to decision
Holger Dell, John Lapinskas
In this paper, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions. (Thus we use an oracle that decides whether…
cs.CC2017
A Fixed-Parameter Perspective on #BIS
Radu Curticapean, Holger Dell, Fedor Fomin +2
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 complexi…