The Shannon Lower Bound Is Asymptotically Tight.
Tobias KochPublished in: IEEE Trans. Inf. Theory (2016)
Keyphrases
- lower bound
- upper bound
- worst case
- information theory
- branch and bound algorithm
- branch and bound
- np hard
- lower and upper bounds
- sample size
- lower bounding
- optimal solution
- upper and lower bounds
- objective function
- asymptotically optimal
- central limit theorem
- search engine
- data sets
- approximation algorithms
- decision trees
- information systems
- lagrangian relaxation
- online algorithms
- shannon entropy
- database