The communication complexity of set intersection under product distributions

DOI10.4230/LIPICS.ICALP.2023.95MaRDI QIDQ6638100zbMATH OpenFDO

Authors Rotem Oshman

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.95

zbMATH Keywords

communication complexityintersectionset disjointness

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(1)

• Multi-party set disjointness and intersection with bounded dependence

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638100)