8 citations · 13 across the 14 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Approximately counting independent sets in dense bipartite graphs via subspace enumeration
Charlie Carlson, Ewan Davies, Alexandra Kolla +1
We give a randomized algorithm that approximates the number of independent sets in a dense, regular bipartite graph -- in the language of approximate counting, we give an FPRAS for…
math.CO2023
Blocking sets, minimal codes and trifferent codes
Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt +1
We prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension…