@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}
}

{"_id":"Pz3ysiwebxKEWMe5t","bibbaseid":"manurangsi-nakkiran-trevisan-nearoptimalugchardnessofapproximatingmaxkcspr-2016","author_short":["Manurangsi, P.","Nakkiran, P.","Trevisan, L."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Pasin"],"propositions":[],"lastnames":["Manurangsi"],"suffixes":[]},{"firstnames":["Preetum"],"propositions":[],"lastnames":["Nakkiran"],"suffixes":[]},{"firstnames":["Luca"],"propositions":[],"lastnames":["Trevisan"],"suffixes":[]}],"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ü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","bibtex":"@inproceedings{DBLP:conf/approx/ManurangsiNT16,\n author = {Pasin Manurangsi and\n Preetum Nakkiran and\n Luca Trevisan},\n title = {Near-Optimal UGC-hardness of Approximating Max k-CSP{\\_}R},\n booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms\n and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,\n France},\n series = {LIPIcs},\n volume = {60},\n pages = {15:1--15:28},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik},\n year = {2016},\n url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.15},\n doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.15},\n timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},\n biburl = {https://dblp.org/rec/conf/approx/ManurangsiNT16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Manurangsi, P.","Nakkiran, P.","Trevisan, L."],"key":"DBLP:conf/approx/ManurangsiNT16","id":"DBLP:conf/approx/ManurangsiNT16","bibbaseid":"manurangsi-nakkiran-trevisan-nearoptimalugchardnessofapproximatingmaxkcspr-2016","role":"author","urls":{"Paper":"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.15"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://preetum.nakkiran.org/pubs/pubs.bib","dataSources":["mYRuxxL9PCiJjf4nA"],"keywords":[],"search_terms":["near","optimal","ugc","hardness","approximating","max","csp","manurangsi","nakkiran","trevisan"],"title":"Near-Optimal UGC-hardness of Approximating Max k-CSP_R","year":2016}