Sciweavers

Share
CORR
2008
Springer

Product theorems via semidefinite programming

8 years 2 months ago
Product theorems via semidefinite programming
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
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Troy Lee, Rajat Mittal
Comments (0)
books