Near-Optimal UGC-hardness of Approximating Max k-CSP

Near-Optimal UGC-hardness of Approximating Max k-CSP_R. Manurangsi, P., Nakkiran, P., & Trevisan, L. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, volume 60, of LIPIcs, pages 15:1–15:28, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Paper doi bibtex

@inproceedings{DBLP:conf/approx/ManurangsiNT16,
  author    = {Pasin Manurangsi and
               Preetum Nakkiran and
               Luca Trevisan},
  title     = {Near-Optimal UGC-hardness of Approximating Max k-CSP{\_}R},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
               France},
  series    = {LIPIcs},
  volume    = {60},
  pages     = {15:1--15:28},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.15},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2016.15},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/approx/ManurangsiNT16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0