A nontrivial lower bound on the Shannon capacities of the complements of odd cycles.
Tom BohmanRon HolzmanPublished in: IEEE Trans. Inf. Theory (2003)
Keyphrases
- lower bound
- upper bound
- information theory
- branch and bound algorithm
- np hard
- branch and bound
- objective function
- optimal solution
- lower bounding
- lower and upper bounds
- np complete
- vc dimension
- worst case
- upper and lower bounds
- lagrangian relaxation
- shannon entropy
- sufficiently accurate
- sample complexity
- information theoretic
- mutual information
- information retrieval
- fixed number
- search algorithm
- constant factor
- randomized algorithm
- data sets