Hypergraph Samplers: Typical and Worst Case Behavior

Vedat Levi Alev, Uriya A. First

We study the utility and limitations of using $k$-uniform hypergraphs $H=([n],E)$ ($n\ge \mathrm{poly}(k)$) in the context of error reduction for randomized algorithms for deci…