Communication Lower Bounds Using Directional Derivatives (Q5501937): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1145/2629334
@@ Property / full work available at URL: https://doi.org/10.1145/2629334 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1989966214
@@ Property / OpenAlex ID: W1989966214 / rank @@
+Normal rank
@@ Property / cites work @@
+On complexity of computation of partial derivatives of Boolean functions realized by Zhegalkin polynomials
+Normal rank
@@ Property / cites work @@
+The cost of the missing bit: Communication complexity with help
+Normal rank
@@ Property / cites work @@
+Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
+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 @@
+A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
+Normal rank
@@ Property / cites work @@
+Pseudo-Boolean optimization
@@ Property / cites work: Pseudo-Boolean optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542521
@@ Property / cites work: Q4542521 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3568106
@@ Property / cites work: Q3568106 / rank @@
+Normal rank
@@ Property / cites work @@
+The NOF multiparty communication complexity of composed functions
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Q3002823
@@ Property / cites work: Q3002823 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of Boolean functions in different characteristics
+Normal rank
@@ Property / cites work @@
+Q3416242
@@ Property / cites work: Q3416242 / rank @@
+Normal rank
@@ Property / cites work @@
+AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
@@ Property / cites work: AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM / rank @@
+Normal rank
@@ Property / cites work @@
+The BNS lower bound for multi-party protocols is nearly optimal
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / 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 @@
+Q5302084
@@ Property / cites work: Q5302084 / rank @@
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+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 @@
+Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotics in statistics. Some basic concepts.
@@ Property / cites work: Asymptotics in statistics. Some basic concepts. / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for local versions of dimension reductions
+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 @@
+Q5595902
@@ Property / cites work: Q5595902 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+A User's Guide to Measure Theoretic Probability
@@ Property / cites work: A User's Guide to Measure Theoretic Probability / rank @@
+Normal rank
@@ Property / cites work @@
+A Counterexample to Strong Parallel Repetition
@@ Property / cites work: A Counterexample to Strong Parallel Repetition / 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 @@
+Separating ${AC}^0$ from Depth-2 Majority Circuits
+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 @@
+Strong Direct Product Theorems for Quantum Communication and Query Complexity
+Normal rank
@@ Property / cites work @@
+Q3633949
@@ Property / cites work: Q3633949 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean derivatives on cellular automata
@@ Property / cites work: Boolean derivatives on cellular automata / rank @@
+Normal rank
@@ Property / cites work @@
+One-way multiparty communication lower bound for pointer jumping with applications
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5501937