MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Author(s)
Kopparty, Swastik; Raghavendra, Prasad; Jayram, T. S
Thumbnail
DownloadJayram-2009-On the communication complexity of read-once ACO formulae.pdf (419.6Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Alternative title
On the communication complexity of read-once ACO formulae
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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)[subscript 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 omicron 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 communication complexity of f[superscript T](x, y) is n/2[superscript Omega(d log d)]. These results generalize classical results on the communication complexity of set-disjointness (where T is an OR -gate) and recent results on the communication complexity of the TRIBES functions (where T is a depth-2 read-once formula). Our techniques build on and extend the information complexity methodology for proving lower bounds on randomized communication complexity. Our analysis for trees of depth d proceeds in two steps: (1) reduction to measuring the information complexity of binary depth-d trees, and (2) proving lower bounds on the information complexity of binary trees. In order to execute this program, we carefully construct input distributions under which both these steps can be carried out simultaneously. We believe the tools we develop will prove useful in further studies of information complexity in particular, and communication complexity in general.
Date issued
2009-09
URI
http://hdl.handle.net/1721.1/54688
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
24th Annual IEEE Conference on Computational Complexity, 2009. CCC '09.
Publisher
Institute of Electrical and Electronics Engineers
Citation
Jayram, T.S., S. Kopparty, and P. Raghavendra. “On the Communication Complexity of Read-Once AC^0 Formulae.” Computational Complexity, 2009. CCC '09. 24th Annual IEEE Conference on. 2009. 329-340. © 2009 IEEE
Version: Final published version
ISBN
978-0-7695-3717-7
ISSN
1093-0159
Keywords
Lower bounds, Information complexity, Communication complexity, AND-OR trees

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.