Lower bounds on $q$-wise independence tails and applications to min-entropy condensers.
Maciej SkorskiPublished in: CoRR (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- information theory
- mutual information
- objective function
- np hard
- lower and upper bounds
- information theoretic
- optimal cost
- long tail
- conditional independence
- lower bounding
- upper and lower bounds
- information entropy
- online algorithms
- polynomial approximation
- worst case
- fuzzy entropy
- entropy measure
- independence assumption
- max sat
- neural network
- pairwise
- search space
- online learning