Login / Signup

Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness.

Amit ChakrabartiSubhash KhotXiaodong Sun
Published in: Computational Complexity Conference (2003)
Keyphrases
  • multi party
  • lower bound
  • upper bound
  • lower and upper bounds
  • case study
  • objective function
  • worst case