Lower bounds on the communication complexity of two-party (quantum) processes.
Alberto MontinaStefan WolfPublished in: CoRR (2014)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- communication channels
- complexity measures
- average case complexity
- communication networks
- space complexity
- objective function
- average case
- computational cost
- communication patterns
- np hard
- branch and bound
- information sharing
- communication cost
- communication systems
- vc dimension
- lower and upper bounds