A direct product theorem for the two-party bounded-round public-coin communication complexity
10.1109/FOCS.2012.42
Saved in:
Main Authors: | Jain, R., Pereszlenyi, A., Yao, P. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40762 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
The partition bound for classical communication complexity and query complexity
by: Jain, R., et al.
Published: (2013) -
New bounds on classical and quantum one-way communication complexity
by: Jain, R., et al.
Published: (2013) -
Studies in Communication Complexity and Semidefinite Programs
by: PENGHUI YAO
Published: (2014) -
Optimal direct sum results for deterministic and randomized decision tree complexity
by: Jain, R., et al.
Published: (2013) -
Malaysia and the Uruguay Round of Negotiations
by: MICHELA ASTUTO
Published: (2010)