Q4612486 (Q4612486): Difference between revisions

@@ Property / DOI @@
-.4086/toc.2018.v014a021
@@ Property / DOI: 10.4086/toc.2018.v014a021 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4086/toc.2018.v014a021
+Normal rank
@@ Property / OpenAlex ID @@
+W2908369137
@@ Property / OpenAlex ID: W2908369137 / rank @@
+Normal rank
@@ Property / cites work @@
+The NOF multiparty communication complexity of composed functions
+Normal rank
@@ Property / cites work @@
+Communication Complexity of Simultaneous Messages
@@ Property / cites work: Communication Complexity of Simultaneous Messages / rank @@
+Normal rank
@@ Property / cites work @@
+Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
+Normal rank
@@ Property / cites work @@
+Q3002822
@@ Property / cites work: Q3002822 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremath{\sfAC}^0$
+Normal rank
@@ Property / cites work @@
+Perceptrons, PP, and the polynomial hierarchy
@@ Property / cites work: Perceptrons, PP, and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009530
@@ Property / cites work: Q5009530 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2969648
@@ Property / cites work: Q2969648 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of the congested clique model
@@ Property / cites work: On the power of the congested clique model / rank @@
+Normal rank
@@ Property / cites work @@
+Majority gates vs. general weighted threshold gates
+Normal rank
@@ Property / cites work @@
+The BNS lower bound for multi-party protocols is nearly optimal
+Normal rank
@@ Property / cites work @@
+Polynomial threshold functions and Boolean threshold circuits
+Normal rank
@@ Property / cites work @@
+On the Size of Weights for Threshold Gates
@@ Property / cites work: On the Size of Weights for Threshold Gates / rank @@
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+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 @@
+Towards polynomial lower bounds for dynamic problems
+Normal rank
@@ Property / cites work @@
+Q4601824
@@ Property / cites work: Q4601824 / rank @@
+Normal rank
@@ Property / cites work @@
+The BNS-Chung criterion for multi-party communication complexity
+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 @@
+Halfspace matrices
@@ Property / cites work: Halfspace matrices / rank @@
+Normal rank
@@ Property / cites work @@
+The Intersection of Two Halfspaces Has High Threshold Degree
+Normal rank
@@ Property / cites work @@
+Communication Lower Bounds Using Directional Derivatives
+Normal rank
@@ Property / cites work @@
+The Multiparty Communication Complexity of Set Disjointness
+Normal rank
@@ Property / cites work @@
+Q4612487
@@ Property / cites work: Q4612487 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4598150
@@ Property / cites work: Q4598150 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient quantum protocols for XOR functions
@@ Property / cites work: Efficient quantum protocols for XOR functions / rank @@
+Normal rank
@@ Property / DOI @@
+.4086/TOC.2018.V014A021
@@ Property / DOI: 10.4086/TOC.2018.V014A021 / rank @@
+Normal rank