Lower Bounds for CSP Refutation by SDP Hierarchies

Ryuhei Mori, David Witmer. Lower Bounds for CSP Refutation by SDP Hierarchies. In Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France. Volume 60 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{MoriW16-0,
  title = {Lower Bounds for CSP Refutation by SDP Hierarchies},
  author = {Ryuhei Mori and David Witmer},
  year = {2016},
  doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.41},
  url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.41},
  researchr = {https://researchr.org/publication/MoriW16-0},
  cites = {0},
  citedby = {0},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France},
  editor = {Klaus Jansen and Claire Mathieu and José D. P. Rolim and Chris Umans},
  volume = {60},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-018-7},
}