A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels.
Assaf Ben-YishaiYoung-Han KimOr OrdentlichOfer ShayevitzPublished in: CoRR (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- objective function
- worst case
- np hard
- lower bounding
- multi channel
- linear programming relaxation
- data structure
- virtual reality
- online learning
- computational complexity
- lower and upper bounds
- upper and lower bounds
- lagrangian relaxation