On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first 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
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
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
The Quantum Communication Complexity of Sampling
SIAM Journal on Computing
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
Perceptrons: An Introduction to Computational Geometry
Perceptrons: An Introduction to Computational Geometry
Bounded-error quantum state identification and exponential separations in communication complexity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Fingerprinting
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing
Classical interaction cannot replace a quantum message
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
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
Exponential Separation of Quantum and Classical One-Way Communication Complexity
SIAM Journal on Computing
Separating ${AC}^0$ from Depth-2 Majority Circuits
SIAM Journal on Computing
Quantum communication complexity of block-composed functions
Quantum Information & Computation
SIAM Journal on Computing
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and 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
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |
An open problem in communication complexity proposed by several authors is to provethat for every Boolean function f, the task of computing f(x ∧ y) has polynomiallyrelated classical and quantum bounded-error complexities. We solve a variant of thisquestion. For every f, we prove that the task of computing, on input x and y, both of thequantities f(x∧y) and f(x∨y) has polynomially related classical and quantum boundederrorcomplexities. We further show that the quantum bounded-error complexity ispolynomially related to the classical deterministic complexity and the block sensitivityof f. This result holds regardless of prior entanglement.