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 Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Probabilistic Boolean decision trees and the complexity of evaluating game trees
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On the Communication Complexity of Read-Once AC^0 Formulae
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On quantum-classical equivalence for composed communication problems
Quantum Information & Computation
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We show lower bounds of Ω(√n) and Ω(n1/4) on the randomized and quantum communication complexity, respectively, of all n variable read-once Boolean formulas. Our results complement the recent lower bound of Ω(n/8d) by Leonardos and Saks [LS09] and Ω(n/2O(d log d)) by Jayram, Kopparty and Raghavendra [JKR09] for randomized communication complexity of read-once Boolean formulas with depth d. We obtain our result by "embedding" either the Disjointness problem or its complement in any given read-once Boolean formula.