Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness.
Anup RaoAmir YehudayoffPublished in: Computational Complexity Conference (2015)
Keyphrases
- multi party
- lower bound
- privacy preserving
- human communication
- turn taking
- worst case
- upper bound
- objective function
- cooperative
- branch and bound algorithm
- branch and bound
- average case complexity
- audio video
- description language
- mental states
- web services
- np hard
- optimal solution
- lower and upper bounds
- secret sharing
- software development
- case study