Fooling Pairs in Randomized Communication Complexity (Q2835016): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-48314-6_4
+Normal rank
@@ Property / OpenAlex ID @@
+W1697076466
@@ Property / OpenAlex ID: W1697076466 / rank @@
+Normal rank
@@ Property / cites work @@
+Perturbed Identity Matrices Have High Rank: Proof and Applications
+Normal rank
@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+How to Compress Interactive Communication
@@ Property / cites work: How to Compress Interactive Communication / rank @@
+Normal rank
@@ Property / cites work @@
+A Zero-One Law for Boolean Privacy
@@ Property / cites work: A Zero-One Law for Boolean Privacy / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002788
@@ Property / cites work: Q3002788 / rank @@
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+Normal rank
@@ Property / cites work @@
+Geometric arguments yield better bounds for threshold circuits and distributed computing
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds in Communication Complexity
@@ Property / cites work: Lower Bounds in Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Private vs. common random bits in communication complexity
+Normal rank
@@ Property / cites work @@
+Probabilistic communication complexity
@@ Property / cites work: Probabilistic communication complexity / rank @@
+Normal rank