Let f : {0, 1}n → {0, 1} be a boolean function. Its associated XOR function is the two-party function f(x, y) = f(x y). We show that, up to polynomial factors, the deterministic communication complexity of f is equal to the parity decision tree complexity of f. This relies on a novel technique of entropy reduction for protocols, combined with existing techniques in Fourier analysis and additive combinatorics
The central focus of computational complexity theory is to measure the "hardness" of computing diffe...
A linear array network consists of k + 1 processors P 0;P 1;:::;Pk with links only between Pi and Pi...
We obtain new separation results for the two-party external information complexity of Boolean functi...
Let f : {0, 1}n → {0, 1} be a boolean function. Its associated XOR function is the two-party functio...
AbstractThe parity decision tree model extends the decision tree model by allowing the computation o...
Abstract. We study the communication complexity of symmetric XOR functions, namely functions f: {0, ...
We study deterministic one-way communication complexity of functions with Hankel communication matr...
For any n-bit boolean function f, we show that the randomized communication complexity of the compos...
Abstract—We study Boolean functions with sparse Fourier spectrum or small spectral norm, and show th...
AbstractWe derive a general technique for obtaining lower bounds on the multiparty communication com...
In this paper we prove several fundamental theorems, concerning the multi--party communication compl...
We study depth 3 circuits of the form OR-AND-XOR, or equivalently -- DNF of parities. This model was...
AbstractWe examine the power of Boolean functions with low L1 norms in several settings. In a large ...
This dissertation is concerned with the application of notions and methods from the field of informa...
In this chapter we survey the theory of two-party communication complexity. This field of theoretica...
The central focus of computational complexity theory is to measure the "hardness" of computing diffe...
A linear array network consists of k + 1 processors P 0;P 1;:::;Pk with links only between Pi and Pi...
We obtain new separation results for the two-party external information complexity of Boolean functi...
Let f : {0, 1}n → {0, 1} be a boolean function. Its associated XOR function is the two-party functio...
AbstractThe parity decision tree model extends the decision tree model by allowing the computation o...
Abstract. We study the communication complexity of symmetric XOR functions, namely functions f: {0, ...
We study deterministic one-way communication complexity of functions with Hankel communication matr...
For any n-bit boolean function f, we show that the randomized communication complexity of the compos...
Abstract—We study Boolean functions with sparse Fourier spectrum or small spectral norm, and show th...
AbstractWe derive a general technique for obtaining lower bounds on the multiparty communication com...
In this paper we prove several fundamental theorems, concerning the multi--party communication compl...
We study depth 3 circuits of the form OR-AND-XOR, or equivalently -- DNF of parities. This model was...
AbstractWe examine the power of Boolean functions with low L1 norms in several settings. In a large ...
This dissertation is concerned with the application of notions and methods from the field of informa...
In this chapter we survey the theory of two-party communication complexity. This field of theoretica...
The central focus of computational complexity theory is to measure the "hardness" of computing diffe...
A linear array network consists of k + 1 processors P 0;P 1;:::;Pk with links only between Pi and Pi...
We obtain new separation results for the two-party external information complexity of Boolean functi...
.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG