A Tight Lower Bound for Entropy Flattening.
Yi-Hsiu ChenMika GöösSalil P. VadhanJiapeng ZhangPublished in: Computational Complexity Conference (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- information theory
- objective function
- branch and bound
- worst case
- np hard
- information theoretic
- lower and upper bounds
- optimal solution
- lower bounding
- upper and lower bounds
- mutual information
- information entropy
- minimum error
- computational complexity
- scheduling problem
- special case
- feature selection
- conditional entropy
- real time