Communication complexity and quasi randomness
SIAM Journal on Discrete Mathematics
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
The BNS lower bound for multi-party protocols is nearly optimal
Information and Computation
Computational Complexity - Special issue on circuit complexity
Communication complexity
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Communication Complexity of Simultaneous Messages
SIAM Journal on Computing
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Separating the communication complexities of MOD m and MOD p circuits
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Lower Bounds on Quantum Multiparty Communication Complexity
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Multiparty Communication Complexity and Threshold Circuit Size of AC^0
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Communication complexities of symmetric XOR functions
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Hi-index | 0.00 |
We study the k-party ‘number on the forehead' communication complexity of composed functions f∘g, where f:{0,1}n→{±1}, g : {0,1}k→{0,1} and for (x1,…,xk)∈({0,1}n)k, f∘g(x1,…,xk)=f(…,g(x1,i,…,xk,i), …). We show that there is an O(log3n) cost simultaneous protocol for $\textnormal{\textsc{sym}} \circ g$ when k1+logn, $\textnormal{\textsc{sym}}$ is any symmetric function and g is any function. Previously, an efficient protocol was only known for $\textnormal{\textsc{sym}} \circ g$ when g is symmetric and "compressible". We also get a non-simultaneous protocol for $\textnormal{\textsc{sym}} \circ g$ of cost O((n/2k) logn+k logn) for any k≥2. In the setting of k≤1+logn, we study more closely functions of the form $\textnormal{\textsc{majority}} \circ g$, $\textnormal{\textsc{mod}}_m \circ g$, and $\textnormal{\textsc{nor}} \circ g$, where the latter two are generalizations of the well-known and studied functions Generalized Inner Product and Disjointness respectively. We characterize the communication complexity of these functions with respect to the choice of g. As the main application of our results, we answer a question posed by Babai et al. (SIAM Journal on Computing, 33:137---166, 2004) and determine the communication complexity of $\textnormal{\textsc{majority}} \circ \textnormal{\textsc{qcsb}}_k$, where $\textnormal{\textsc{qcsb}}_k$ is the "quadratic character of the sum of the bits" function.