The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On quantum-classical equivalence for composed communication problems
Quantum Information & Computation
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Unbounded-error quantum query complexity
Theoretical Computer Science
| Hi-index | 0.00 |
Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions $f(g_1(x^1, y^1), \ldots, g_n(x^n, y^n))$ by simulating a decision tree computation for f [3]. It is also well-known that this simulation can be very inefficient for some functions f and (g 1, ..., g n ). In this paper we show that the simulation is actually polynomially tight up to the choice of (g 1, ..., g n ). This also implies that the classical and quantum communication complexities of certain block-composed functions are polynomially related.