Communication complexity
Quantum computing and communication complexity
Current trends in theoretical computer science
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Limitations of Quantum Advice and One-Way Communication
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
The communication complexity of the Hamming distance problem
Information Processing Letters
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Lattices, mobius functions and communications complexity
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
The Unbounded-Error Communication Complexity of Symmetric Functions
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On the parity complexity measures of Boolean functions
Theoretical Computer Science
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Tight bounds on communication complexity of symmetric XOR functions in one-way and SMP models
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The NOF multiparty communication complexity of composed functions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.01 |
We call F : {0, 1}n × {0, 1}n → {0, 1} a symmetric XOR function if for a functionS : {0, 1, ..., n} → {0, 1}, F(x, y) = S(|x⊕y|), for any x, y ∈ {0, 1}n, where |x⊕y| is theHamming weight of the bit-wise XOR of x and y. We show that for any such function,(a) the deterministic communication complexity is always Θ(n) except for four simplefunctions that have a constant complexity, and (b) up to a polylog factor, both theerror-bounded randomized complexity and quantum communication with entanglementcomplexity are Θ(r0 + r1), where r0 and r1 are the minimum integers such that r0, r1 n/2 and S(k) = S(k + 2) for all k ∈ [r0, n - r1).