Recommendations
Cites work
- A characterization of average case communication complexity
- A direct product theorem for two-party bounded-round public-coin communication complexity
- A Mathematical Theory of Communication
- A Parallel Repetition Theorem
- A property of quantum relative entropy with an application to privacy in quantum communication
- A strong direct product theorem for disjointness
- Amortized Communication Complexity
- An information statistics approach to data stream and communication complexity
- An interactive information odometer and applications
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching
- Communication Complexity
- Communication lower bounds using directional derivatives
- Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
- Direct product via round-preserving compression
- Disjointness is hard in the multiparty number-on-the-forehead model
- Exponential separation of communication and external information
- Exponential Separation of Information and Communication for Boolean Functions
- From information to exact communication
- How to compress interactive communication
- scientific article; zbMATH DE number 5729463 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 2038719 (Why is no real title available?)
- Individual communication complexity
- Information complexity is computable
- Information Equals Amortized Communication
- Information Lower Bounds via Self-reducibility
- Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
- Interactive Information Complexity
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- Lower bounds on information complexity via zero-communication protocols and applications
- Lower bounds on the randomized communication complexity of read-once functions
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- Noiseless coding of correlated information sources
- On the distributional complexity of disjointness
- On the power of small-depth threshold circuits
- Parallel repetition in projection games and a concentration bound
- Privacy, additional information and communication
- Pseudorandom generators for regular branching programs
- Quantum and approximate privacy
- Quantum information complexity
- Quantum one-way communication can be exponentially stronger than classical communication
- Relative discrepancy does not separate information and communication complexity
- Simplified lower bounds on the multiparty communication complexity of disjointness
- Small value parallel repetition for general games
- Some Results on Distributed Source Coding for Interactive Function Computation
- The Communication Complexity of Correlation
- The communication complexity of gap Hamming distance
- The multiparty communication complexity of set disjointness
- The Probabilistic Communication Complexity of Set Intersection
- Towards proving strong direct product theorems
- Worst-case interactive communication. I. Two messages are almost optimal
- Worst-case interactive communication. II. Two messages are not optimal
Cited in
(9)- Information complexity and applications.
- On information complexity in the broadcast model
- Interactive Information Complexity
- Trading information complexity for error
- Information complexity is computable
- Interactive information complexity
- From information to exact communication
- Query-to-communication lifting using low-discrepancy gadgets
- The communication complexity of set intersection and multiple equality testing
This page was built for publication: Interactive information complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592949)
