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)...
Main Authors: | , , |
---|---|
其他作者: | |
格式: | 文件 |
语言: | en_US |
出版: |
Institute of Electrical and Electronics Engineers
2010
|
主题: | |
在线阅读: | http://hdl.handle.net/1721.1/54688 |