A Lower Bound on Entanglement-Assisted Quantum Communication Complexity.
Ashley MontanaroAndreas J. WinterPublished in: ICALP (2007)
Keyphrases
- lower bound
- worst case
- upper bound
- complexity analysis
- objective function
- np hard
- lower and upper bounds
- branch and bound algorithm
- average case complexity
- branch and bound
- average case
- communication networks
- computational cost
- computational complexity
- decision problems
- approximation algorithms
- communication systems
- space complexity
- online learning
- quantum computation
- multi agent