Lower Bounds on the Multiparty Communication Complexity.

Pavol Duris José D. P. Rolim

Published in: J. Comput. Syst. Sci. (1998)

Keyphrases

multi party
lower bound
privacy preserving
human communication
turn taking
worst case
upper bound
secret sharing
average case complexity
branch and bound
description language
np hard
branch and bound algorithm
artificial intelligence
case study
mental states