Sciweavers

11 search results - page 3 / 3
» Approximating coloring and maximum independent sets in 3-uni...
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani