Login / Signup

Lower bounds for number-in-hand multiparty communication complexity, made easy.

Jeff M. PhillipsElad VerbinQin Zhang
Published in: SODA (2012)
Keyphrases
  • multi party
  • lower bound
  • space complexity
  • computational complexity
  • upper bound
  • np hard
  • memory requirements
  • software engineering
  • worst case
  • constraint programming
  • search strategy
  • search strategies