Hellinger volume and number-on-the-forehead communication complexity (Q295642): 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 @@
+Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
+Normal rank
@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+Multiparty Communication Complexity and Threshold Circuit Size of AC^0
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On ACC
@@ Property / cites work: On ACC / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity and Quasi Randomness
@@ Property / cites work: Communication Complexity and Quasi Randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of Information Theory
@@ Property / cites work: Elements of Information Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+The BNS lower bound for multi-party protocols is nearly optimal
+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 @@
+Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
+Normal rank
@@ Property / cites work @@
+Two applications of information complexity
@@ Property / cites work: Two applications of information complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Quantum Communication Complexity
@@ Property / cites work: Lower Bounds for Quantum Communication Complexity / rank @@
+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 in communication complexity based on factorization norms
+Normal rank
@@ Property / cites work @@
+Q4435806
@@ Property / cites work: Q4435806 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284623
@@ Property / cites work: Q4284623 / rank @@
+Normal rank
@@ Property / cites work @@
+Rounds in Communication Complexity Revisited
@@ Property / cites work: Rounds in Communication Complexity Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+The BNS-Chung criterion for multi-party communication complexity
+Normal rank
@@ Property / cites work @@
+Quantum communication complexity of symmetric predicates
+Normal rank
@@ Property / cites work @@
+Space lower bounds for distance approximation in the data stream model
+Normal rank
@@ Property / cites work @@
+The Pattern Matrix Method
@@ Property / cites work: The Pattern Matrix Method / 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