Please use this identifier to cite or link to this item:
|Title:||The partition bound for classical communication complexity and query complexity|
|Authors:||Jain, R. |
|Citation:||Jain, R., Klauck, H. (2010). The partition bound for classical communication complexity and query complexity. Proceedings of the Annual IEEE Conference on Computational Complexity : 247-258. ScholarBank@NUS Repository. https://doi.org/10.1109/CCC.2010.31|
|Abstract:||We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the partition bound is stronger than both the rectangle/corruption bound and the γ2/generalized discrepancy bounds. In the model of query complexity we show that the partition bound is stronger than the approximate polynomial degree and classical adversary bounds. We also exhibit an example where the partition bound is quadratically larger than the approximate polynomial degree and adversary bounds. © 2010 IEEE.|
|Source Title:||Proceedings of the Annual IEEE Conference on Computational Complexity|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 15, 2019
WEB OF SCIENCETM
checked on Jan 7, 2019
checked on Dec 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.