5 citations · 6 across the 4 of their papers we have counts for
1 paper · 1 filter
Jared Miller, Yang Zheng, Biel Roig-Solvas +2
Semidefinite programs (SDPs) often arise in relaxations of some NP-hard problems, and if the solution of the SDP obeys certain rank constraints, the relaxation will be tight. Decom…