On the Communication Complexity of Read-Once AC^0 Formulae

On the Communication Complexity of Read-Once AC^0 Formulae

We study the 2-party randomized communication complexity of read-once AC[superscript 0] formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication complexity of the function f[superscript T](x, y) = T(x omicron y) is Omega(n/4[superscript d]) where (x omicron y)...

Full description

Bibliographic Details
Main Authors: Kopparty, Swastik, Raghavendra, Prasad, Jayram, T. S
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2010
Subjects:
Lower bounds
Information complexity
Communication complexity
AND-OR trees
Online Access:http://hdl.handle.net/1721.1/54688

Similar Items

Similar Items