Hardness of constant-round communication complexity

DOI10.4230/LIPICS.CCC.2021.31MaRDI QIDQ6115394zbMATH OpenOpenAlexFDO

Authors Shuichi Hirahara, Rahul Ilango, Bruno Loff

Publication date 12 July 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.CCC.2021.31

zbMATH Keywords

communication complexitymeta-complexityNP-completenessround elimination lemma

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• Rounds in Communication Complexity Revisited

This page was built for publication: Hardness of constant-round communication complexity

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