Communication Complexity Theory: Thirty-Five Years of Set Disjointness

DOI10.1007/978-3-662-44522-8_3zbMath1425.68123OpenAlexW2169422095MaRDI QIDQ2921999

Alexander A. Sherstov

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_3

zbMATH Keywords

communication complexitysurvey articlecommunication lower boundsset disjointness problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Dimension-free bounds and structural results in communication complexity ⋮ Unnamed Item ⋮ Connecting knowledge compilation classes and width parameters

This page was built for publication: Communication Complexity Theory: Thirty-Five Years of Set Disjointness