Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2008
Springer

favoriteEmaildiscussreport

111views Education» more CORR 2008»

Product theorems via semidefinite programming

13 years 4 months ago

Product theorems via semidefinite programming

Download www1.cs.columbia.edu

The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov

Troy Lee, Rajat Mittal

Real-time Traffic

Communication Complexity | CORR 2008 | Education | Semidefinite Programs | Theory |

claim paper

Related Content

» A Direct Product Theorem for Discrepancy

» Learning the Kernel Matrix with SemiDefinite Programming

» Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems

» Boundederror quantum state identification and exponential separations in communication com...

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Troy Lee, Rajat Mittal

Comments (0)