A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
On the Communication Complexity of Read-Once AC^0 Formulae
2009
2009 24th Annual IEEE Conference on Computational Complexity
We study the 2-party randomized communication complexity of read-once AC 0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication complexity of the function where (x • y)i is defined so that the resulting tree also has alternating levels of AND and OR gates. For each bit of x, y, the operation • is either AND or OR depending on the gate in T to which it is an input. Using this, we show that for general AND-OR trees T with n inputs and depth d, the
doi:10.1109/ccc.2009.39
dblp:conf/coco/JayramKR09
fatcat:54jkkbv6h5b2bavpkgx6qrtwb4