The unbounded-error communication complexity of symmetric functions (Q2428632)

The paper proves that the unbounded-error communication complexity of every symmetric function \(f(x,y) = D(| x \wedge y| )\), where \(D\) is a predicate on \(\{0,1,,\cdots ,n\}\) and \(x,y \in \{0,1\}^{n}\), is between \(\theta (k/log^{5} n)\) and \(\theta (k log n)\), where \(k\) is the number of value changes of D in \(\{0,1,\dots ,n\}\).