Derandomizing Chernoff Bound with Union Bound with an Application to k-wise Independent Sets
Abstract
Derandomization of Chernoff bound with union bound is already proven in many papers. We here give another explicit version of it that obtains a construction of size that is arbitrary close to the probabilistic nonconstructive size. We apply this to give a new simple polynomial time constructions of almost k-wise independent sets. We also give almost tight lower bounds for the size of k-wise independent sets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.