The communication complexity of multiparty set disjointness under product distributions

DOI10.1145/3406325.3451106OpenAlexW3170407035MaRDI QIDQ6065244

Nachum Dershowitz, Unnamed Author, Rotem Oshman

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451106

zbMATH Keywords

communication complexityset disjointnessproduct distributions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Communication-efficient distributed graph clustering and sparsification under duplication models

This page was built for publication: The communication complexity of multiparty set disjointness under product distributions