scientific article

DOI10.4086/toc.2016.v012a009zbMath1365.68259OpenAlexW3037028364MaRDI QIDQ2816409

No author found.

Publication date: 22 August 2016

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2016.v012a009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

communication complexitycomplexity classesset-disjointness

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

The landscape of communication complexity classes ⋮ Communication complexity with small advantage ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Communication Complexity of Set Intersection and Multiple Equality Testing ⋮ On the streaming indistinguishability of a random permutation and a random function

Cites Work

• Unnamed Item
• The Pattern Matrix Method
• Lower Bounds for Swapping Arthur and Merlin
• An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

This page was built for publication: