82 search results - page 1 / 17 » Product Rules in Semidefinite Programming |
FCT
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
DIS
1999
Springer
14 years 3 months ago
1999
Springer
TSP
2010
13 years 5 months ago
2010
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
COCO
2008
Springer
14 years 29 days ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...