Interactive Information Complexity (Q4592949): Difference between revisions

@@ Property / cites work @@
+Lower bounds for one-way probabilistic communication complexity and their application to space complexity
+Normal rank
@@ Property / cites work @@
+Privacy, additional information and communication
@@ Property / cites work: Privacy, additional information and communication / rank @@
+Normal rank
@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+How to Compress Interactive Communication
@@ Property / cites work: How to Compress Interactive Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive Information Complexity
@@ Property / cites work: Interactive Information Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Small Value Parallel Repetition for General Games
@@ Property / cites work: Small Value Parallel Repetition for General Games / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
+Normal rank
@@ Property / cites work @@
+From information to exact communication
@@ Property / cites work: From information to exact communication / rank @@
+Normal rank
@@ Property / cites work @@
+Information Lower Bounds via Self-reducibility
@@ Property / cites work: Information Lower Bounds via Self-reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Information Equals Amortized Communication
@@ Property / cites work: Information Equals Amortized Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Generators for Regular Branching Programs
+Normal rank
@@ Property / cites work @@
+Direct Product via Round-Preserving Compression
@@ Property / cites work: Direct Product via Round-Preserving Compression / rank @@
+Normal rank
@@ Property / cites work @@
+Information complexity is computable
@@ Property / cites work: Information complexity is computable / rank @@
+Normal rank
@@ Property / cites work @@
+A discrepancy lower bound for information complexity
+Normal rank
@@ Property / cites work @@
+An Interactive Information Odometer and Applications
+Normal rank
@@ Property / cites work @@
+Individual communication complexity
@@ Property / cites work: Individual communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3573554
@@ Property / cites work: Q3573554 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of average case communication complexity
+Normal rank
@@ Property / cites work @@
+Amortized Communication Complexity
@@ Property / cites work: Amortized Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Relative Discrepancy Does not Separate Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+Exponential separation of communication and external information
+Normal rank
@@ Property / cites work @@
+Exponential Separation of Information and Communication for Boolean Functions
+Normal rank
@@ Property / cites work @@
+The Communication Complexity of Correlation
@@ Property / cites work: The Communication Complexity of Correlation / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of small-depth threshold circuits
@@ Property / cites work: On the power of small-depth threshold circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
+Normal rank
@@ Property / cites work @@
+A direct product theorem for two-party bounded-round public-coin communication complexity
+Normal rank
@@ Property / cites work @@
+Q4449184
@@ Property / cites work: Q4449184 / rank @@
+Normal rank
@@ Property / cites work @@
+A property of quantum relative entropy with an application to privacy in quantum communication
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
+Normal rank
@@ Property / cites work @@
+Quantum one-way communication can be exponentially stronger than classical communication
+Normal rank
@@ Property / cites work @@
+Quantum and approximate privacy
@@ Property / cites work: Quantum and approximate privacy / rank @@
+Normal rank
@@ Property / cites work @@
+A strong direct product theorem for disjointness
@@ Property / cites work: A strong direct product theorem for disjointness / rank @@
+Normal rank
@@ Property / cites work @@
+Interaction in quantum communication and the complexity of set disjointness
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Disjointness is hard in the multiparty number-on-the-forehead model
+Normal rank
@@ Property / cites work @@
+Lower bounds on the randomized communication complexity of read-once functions
+Normal rank
@@ Property / cites work @@
+Some Results on Distributed Source Coding for Interactive Function Computation
+Normal rank
@@ Property / cites work @@
+Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching
+Normal rank
@@ Property / cites work @@
+Worst-case interactive communication. I. Two messages are almost optimal
+Normal rank
@@ Property / cites work @@
+Worst-case interactive communication. II. Two messages are not optimal
+Normal rank
@@ Property / cites work @@
+Parallel Repetition in Projection Games and a Concentration Bound
+Normal rank
@@ Property / cites work @@
+Q4601824
@@ Property / cites work: Q4601824 / rank @@
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On the distributional complexity of disjointness
@@ Property / cites work: On the distributional complexity of disjointness / rank @@
+Normal rank
@@ Property / cites work @@
+Towards proving strong direct product theorems
@@ Property / cites work: Towards proving strong direct product theorems / rank @@
+Normal rank
@@ Property / cites work @@
+A Mathematical Theory of Communication
@@ Property / cites work: A Mathematical Theory of Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Direct Product Theorems for Quantum Communication and Query Complexity
+Normal rank
@@ Property / cites work @@
+Q2913808
@@ Property / cites work: Q2913808 / rank @@
+Normal rank
@@ Property / cites work @@
+The multiparty communication complexity of set disjointness
+Normal rank
@@ Property / cites work @@
+Communication Lower Bounds Using Directional Derivatives
+Normal rank
@@ Property / cites work @@
+Noiseless coding of correlated information sources
+Normal rank
@@ Property / cites work @@
+Quantum Information Complexity
@@ Property / cites work: Quantum Information Complexity / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/17m1139254
+Normal rank
@@ Property / OpenAlex ID @@
+W2767315450
@@ Property / OpenAlex ID: W2767315450 / rank @@
+Normal rank