Amit Chakrabarti, Subhash Khot, Xiaodong Sun. Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. pages 107-117, IEEE Computer Society, 2003. [doi]
@inproceedings{ChakrabartiKS03,
title = {Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness},
author = {Amit Chakrabarti and Subhash Khot and Xiaodong Sun},
year = {2003},
url = {http://csdl.computer.org/comp/proceedings/complexity/2003/1879/00/18790107abs.htm},
researchr = {https://researchr.org/publication/ChakrabartiKS03},
cites = {0},
citedby = {0},
pages = {107-117},
booktitle = {18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark},
publisher = {IEEE Computer Society},
isbn = {0-7695-1879-6},
}