Deterministic communication vs. partition number

DOI10.1109/FOCS.2015.70MaRDI QIDQ6946840zbMATH OpenFDO

Authors Mika Göös, Toniann Pitassi, Thomas Watson

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2015.70

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(1)

• The hardness of decision tree complexity

This page was built for publication: Deterministic communication vs. partition number

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