Optimal Lower Bounds on the Multiparty Communication Complexity.
Pavol DurisJosé D. P. RolimPublished in: STACS (1995)
Keyphrases
- multi party
- lower bound
- worst case
- privacy preserving
- turn taking
- upper bound
- optimal cost
- human communication
- optimal solution
- branch and bound
- objective function
- branch and bound algorithm
- secret sharing
- description language
- np hard
- computational complexity
- average case complexity
- mental states
- dynamic programming
- search space
- audio video
- min sum