The partition bound for classical communication complexity and query complexity
10.1109/CCC.2010.31
Saved in:
Main Authors: | Jain, R., Klauck, H. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40841 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
New bounds on classical and quantum one-way communication complexity
by: Jain, R., et al.
Published: (2013) -
On the black-box complexity of Sperner's Lemma
by: Friedl, K., et al.
Published: (2014) -
A direct product theorem for the two-party bounded-round public-coin communication complexity
by: Jain, R., et al.
Published: (2013) -
Some lower bounds in dynamic networks with oblivious adversaries
by: I. Jahja, et al.
Published: (2021) -
Some lower bounds in dynamic networks with oblivious adversaries
by: I. Jahja, et al.
Published: (2021)