The landscape of communication complexity classes

DOI10.1007/s00037-018-0166-6zbMath1398.68180MaRDI QIDQ1653337

Y. Aharonov

Publication date: 3 August 2018

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6199/

zbMATH Keywords

communication complexity; complexity classes

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)