Hadamard tensors and lower bounds on multiparty communication complexity (Q371197): Difference between revisions

@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542591
@@ Property / cites work: Q4542591 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Multiparty Communication Complexity and Threshold Circuit Size of AC^0
+Normal rank
@@ Property / cites work @@
+On ACC
@@ Property / cites work: On ACC / rank @@
+Normal rank
@@ Property / cites work @@
+Q4141008
@@ Property / cites work: Q4141008 / 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 @@
+Boolean Circuits, Tensor Ranks, and Communication Complexity
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Quasi‐random classes of hypergraphs
@@ Property / cites work: Quasi‐random classes of hypergraphs / 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 @@
+Q4065548
@@ Property / cites work: Q4065548 / 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 @@
+A Hadamard matrix of order 428
@@ Property / cites work: A Hadamard matrix of order 428 / 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 @@
+Q4002255
@@ Property / cites work: Q4002255 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230829
@@ Property / cites work: Q4230829 / rank @@
+Normal rank
@@ Property / cites work @@
+Unexpected upper bounds on the complexity of some communication games
+Normal rank
@@ Property / cites work @@
+The BNS-Chung criterion for multi-party communication complexity
+Normal rank
@@ Property / cites work @@
+New Algorithms for Finding Irreducible Polynomials Over Finite Fields
+Normal rank
@@ Property / cites work @@
+Q3481743
@@ Property / cites work: Q3481743 / rank @@
+Normal rank
@@ Property / cites work @@
+On Some Exponential Sums
@@ Property / cites work: On Some Exponential Sums / rank @@
+Normal rank