Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2571088576
@@ Property / OpenAlex ID: W2571088576 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1505
@@ Property / arXiv ID: 1204.1505 / rank @@
+Normal rank
@@ Property / cites work @@
+The Hardness of Being Private
@@ Property / cites work: The Hardness of Being Private / rank @@
+Normal rank
@@ Property / cites work @@
+How to Compress Interactive Communication
@@ Property / cites work: How to Compress Interactive Communication / rank @@
+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 @@
+Interactive information complexity
@@ Property / cites work: Interactive information complexity / 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 @@
+A discrepancy lower bound for information complexity
+Normal rank
@@ Property / cites work @@
+Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming
+Normal rank
@@ Property / cites work @@
+An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
+Normal rank
@@ Property / cites work @@
+Q3104217
@@ Property / cites work: Q3104217 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Privacy
@@ Property / cites work: Approximate Privacy / rank @@
+Normal rank
@@ Property / cites work @@
+En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
+Normal rank
@@ Property / cites work @@
+A local hidden variable model of quantum correlation exploiting the detection loophole
+Normal rank
@@ Property / cites work @@
+The Communication Complexity of Correlation
@@ Property / cites work: The Communication Complexity of Correlation / rank @@
+Normal rank
@@ Property / cites work @@
+The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited
+Normal rank
@@ Property / cites work @@
+Q4449184
@@ Property / cites work: Q4449184 / rank @@
+Normal rank
@@ Property / cites work @@
+Two applications of information complexity
@@ Property / cites work: Two applications of information complexity / rank @@
+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 @@
+Classical and Quantum Partition Bound and Detector Inefficiency
+Normal rank
@@ Property / cites work @@
+Lower Bounds in Communication Complexity
@@ Property / cites work: Lower Bounds in Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds in communication complexity based on factorization norms
+Normal rank
@@ Property / cites work @@
+Q2913808
@@ Property / cites work: Q2913808 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5414596
@@ Property / cites work: Q5414596 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for distributed functional monitoring
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3449568