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. |
---|---|
其他作者: | COMPUTER SCIENCE |
格式: | Conference or Workshop Item |
出版: |
2013
|
主題: | |
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/40762 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
The partition bound for classical communication complexity and query complexity
由: Jain, R., et al.
出版: (2013) -
New bounds on classical and quantum one-way communication complexity
由: Jain, R., et al.
出版: (2013) -
Studies in Communication Complexity and Semidefinite Programs
由: PENGHUI YAO
出版: (2014) -
Optimal direct sum results for deterministic and randomized decision tree complexity
由: Jain, R., et al.
出版: (2013) -
Malaysia and the Uruguay Round of Negotiations
由: MICHELA ASTUTO
出版: (2010)