scientific article; zbMATH DE number 7009619
From MaRDI portal
Publication:4612484
DOI10.4086/toc.2018.v014a020zbMath1412.68060OpenAlexW2405665546MaRDI QIDQ4612484
No author found.
Publication date: 31 January 2019
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2018.v014a020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
The communication complexity of functions with large outputs ⋮ The work of Mark Braverman ⋮ On the Communication Complexity of Key-Agreement Protocols. ⋮ Exponential Separation of Communication and External Information
Cites Work
- A Mathematical Theory of Communication
- A discrepancy lower bound for information complexity
- The communication complexity of addition
- An information statistics approach to data stream and communication complexity
- Some intersection theorems for ordered sets and graphs
- On the distributional complexity of disjointness
- How to Compress Interactive Communication
- Information Equals Amortized Communication
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
- Interactive Information Complexity
- The Probabilistic Communication Complexity of Set Intersection
- Computing with Noisy Information
- Compressing Interactive Communication Under Product Distributions
- Communication Complexity
- Relative Discrepancy Does Not Separate Information and Communication Complexity
- The Communication Complexity of Correlation
- Public vs Private Coin in Bounded-Round Information
- Exponential separation of communication and external information
- Interactive compression for product distributions
- Exponential Separation of Information and Communication for Boolean Functions
- Unnamed Item
This page was built for publication:
