One-way communication complexity and non-adaptive decision trees

DOI10.4230/LIPICS.STACS.2022.49MaRDI QIDQ6490995zbMATH OpenFDO

Authors Nikhil S. Mande, Swagato Sanyal, Suhail Sherif

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.49

zbMATH Keywords

communication complexitycomposed Boolean functionsdecision trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• A hierarchy of constant communication complexity
• One-way communication complexity of partial XOR functions

This page was built for publication: One-way communication complexity and non-adaptive decision trees

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