Studies in Communication Complexity and Semidefinite Programs
Ph.D
Saved in:
Main Author: | PENGHUI YAO |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/49156 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
New bounds on classical and quantum one-way communication complexity
by: Jain, R., et al.
Published: (2013) -
A direct product theorem for the two-party bounded-round public-coin communication complexity
by: Jain, R., et al.
Published: (2013) -
A parallel approximation algorithm for positive semidefinite programming
by: Jain, R., et al.
Published: (2013) -
The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications
by: Sun, D.
Published: (2014) -
Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming
by: Chan, Z.X., et al.
Published: (2014)