Please use this identifier to cite or link to this item:
https://doi.org/10.1007/978-3-642-14031-0_8
DC Field | Value | |
---|---|---|
dc.title | Depth-independent lower bounds on the communication complexity of read-once Boolean formulas | |
dc.contributor.author | Jain, R. | |
dc.contributor.author | Klauck, H. | |
dc.contributor.author | Zhang, S. | |
dc.date.accessioned | 2013-07-04T08:20:59Z | |
dc.date.available | 2013-07-04T08:20:59Z | |
dc.date.issued | 2010 | |
dc.identifier.citation | Jain, R.,Klauck, H.,Zhang, S. (2010). Depth-independent lower bounds on the communication complexity of read-once Boolean formulas. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6196 LNCS : 54-59. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-14031-0_8" target="_blank">https://doi.org/10.1007/978-3-642-14031-0_8</a> | |
dc.identifier.isbn | 3642140300 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/41159 | |
dc.description.abstract | We show lower bounds of and Ω(n 1/4) on the randomized and quantum communication complexity, respectively, of all n-variable read-once Boolean formulas. Our results complement the recent lower bound of Ω(n/8 d ) by Leonardos and Saks [LS09] and Ω(n/2 O(dlogd)) by Jayram, Kopparty and Raghavendra [JKR09] for randomized communication complexity of read-once Boolean formulas with depth d. We obtain our result by "embedding" either the Disjointness problem or its complement in any given read-once Boolean formula. © 2010 Springer-Verlag Berlin Heidelberg. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-14031-0_8 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1007/978-3-642-14031-0_8 | |
dc.description.sourcetitle | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.description.volume | 6196 LNCS | |
dc.description.page | 54-59 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.