Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models (Q3010420): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1623918381
@@ Property / OpenAlex ID: W1623918381 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4555
@@ Property / arXiv ID: 1101.4555 / rank @@
+Normal rank
@@ Property / cites work @@
+The communication complexity of the Hamming distance problem
+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 @@
+Composition Theorems in Communication Complexity
@@ Property / cites work: Composition Theorems in Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Private vs. common random bits in communication complexity
+Normal rank
@@ Property / cites work @@
+Q3636247
@@ Property / cites work: Q3636247 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of quantum fingerprinting
@@ Property / cites work: On the power of quantum fingerprinting / rank @@
+Normal rank