Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
97
click to vote
CORR
2008
Springer
111
views
Education
»
more
CORR 2008
»
Product theorems via semidefinite programming
15 years 3 months ago
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...
more »
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)
Researcher Info
Education Study Group
Computer Vision