A tight lower bound on the classical communication cost of entanglement dilution.
Aram W. HarrowHoi-Kwong LoPublished in: IEEE Trans. Inf. Theory (2004)
Keyphrases
- lower bound
- communication cost
- upper bound
- sensor networks
- branch and bound algorithm
- communication overhead
- np hard
- objective function
- low bandwidth
- worst case
- branch and bound
- distributed data
- lower and upper bounds
- network size
- optimal solution
- low overhead
- reduce communication cost
- data distribution
- processing cost
- data management
- pattern recognition
- data availability
- databases
- database