Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity.

Jeff Ford Anna Gál

Published in: Complexity of Boolean Functions (2006)

Keyphrases

multi party
lower bound
privacy preserving
turn taking
worst case
upper bound
human communication
secret sharing
computational complexity
objective function
description language
mobile robot
human computer interaction
vc dimension
mental states
branch and bound
domain specific
np hard
expert systems
search algorithm