New bounds on classical and quantum one-way communication complexity
10.1016/j.tcs.2008.10.014
Saved in:
Main Authors: | Jain, R., Zhang, S. |
---|---|
其他作者: | COMPUTER SCIENCE |
格式: | Article |
出版: |
2013
|
主題: | |
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/39441 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
The partition bound for classical communication complexity and query complexity
由: Jain, R., et al.
出版: (2013) -
Studies in Communication Complexity and Semidefinite Programs
由: PENGHUI YAO
出版: (2014) -
A direct product theorem for the two-party bounded-round public-coin communication complexity
由: Jain, R., et al.
出版: (2013) -
A property of quantum relative entropy with an application to privacy in quantum communication
由: Jain, R., et al.
出版: (2013) -
The complexity of the one clean qubit model, the aBc problem, and quantum online optimization
由: DEBBIE LIM HUEY CHIH
出版: (2023)