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. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39441 |
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) -
Studies in Communication Complexity and Semidefinite Programs
by: PENGHUI YAO
Published: (2014) -
A direct product theorem for the two-party bounded-round public-coin communication complexity
by: Jain, R., et al.
Published: (2013) -
A property of quantum relative entropy with an application to privacy in quantum communication
by: Jain, R., et al.
Published: (2013) -
The complexity of the one clean qubit model, the aBc problem, and quantum online optimization
by: DEBBIE LIM HUEY CHIH
Published: (2023)