Lower Bounds on Quantum Multiparty Communication Complexity.
Troy LeeGideon SchechtmanAdi ShraibmanPublished in: Computational Complexity Conference (2009)
Keyphrases
- multi party
- lower bound
- privacy preserving
- human communication
- turn taking
- worst case
- upper bound
- branch and bound
- secret sharing
- computational complexity
- mental states
- description language
- objective function
- branch and bound algorithm
- optimal solution
- audio video
- lower and upper bounds
- vc dimension
- search algorithm
- quantum computing
- average case complexity