scientific article; zbMATH DE number 7250149
From MaRDI portal
Publication:5121897
DOI10.4230/LIPIcs.CCC.2018.9zbMath1441.68054MaRDI QIDQ5121897
No author found.
Publication date: 22 September 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Communication complexity with small advantage ⋮ The communication complexity of functions with large outputs ⋮ Unnamed Item ⋮ On the streaming indistinguishability of a random permutation and a random function
Cites Work
- An information statistics approach to data stream and communication complexity
- Lower bounds on the randomized communication complexity of read-once functions
- On the distributional complexity of disjointness
- Beyond set disjointness
- Certifying Equality With Limited Interaction.
- Information Equals Amortized Communication
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
- Two applications of information complexity
- The Landscape of Communication Complexity Classes.
- Communication Complexity
- An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
- From information to exact communication
- An information complexity approach to extended formulations
- Rectangles Are Nonnegative Juntas
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
