@InProceedings{ghosh_et_al:LIPIcs.CCC.2017.11,
  author =	{Ghosh, Mrinalkanti and Tulsiani, Madhur},
  title =	{{From Weak to Strong LP Gaps for All CSPs}},
  booktitle =	{32nd Computational Complexity Conference (CCC 2017)},
  pages =	{11:1--11:27},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-040-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{79},
  editor =	{O'Donnell, Ryan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.11},
  URN =		{urn:nbn:de:0030-drops-75370},
  doi =		{10.4230/LIPIcs.CCC.2017.11},
  annote =	{Keywords: Constraint Satisfaction Problem, Convex Programming, Linear Programming Hierarchy, Integrality Gap}
}