Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness.
Anup RaoAmir YehudayoffPublished in: Electron. Colloquium Comput. Complex. (2014)
Keyphrases
- multi party
- lower bound
- privacy preserving
- turn taking
- worst case
- human communication
- upper bound
- description language
- average case complexity
- branch and bound algorithm
- secret sharing
- vc dimension
- branch and bound
- lower and upper bounds
- objective function
- computational complexity
- search space
- floor control
- optimal solution