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

Amit Chakrabarti, Subhash Khot, Xiaodong Sun (2003)

> Home

Details and statistics

DOI: 10.1109/CCC.2003.1214414

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/coco/ChakrabartiKS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/ChakrabartiKS03
Amit Chakrabarti, Subhash Khot, Xiaodong Sun:
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. CCC 2003: 107-117

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.