Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs
The worst-case tractability of approximate counting and sampling of fixed-size slices for bipartite independent set problems for bipartite independent set problems is studied.