The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...