The Complexity of Somewhat Approximation Resistant Predicates

Subhash Khot, Madhur Tulsiani, Pratik Worah. The Complexity of Somewhat Approximation Resistant Predicates. Electronic Colloquium on Computational Complexity (ECCC), 19:151, 2012. [doi]

@article{KhotTW12,
  title = {The Complexity of Somewhat Approximation Resistant Predicates},
  author = {Subhash Khot and Madhur Tulsiani and Pratik Worah},
  year = {2012},
  url = {http://eccc.hpi-web.de/report/2012/151},
  researchr = {https://researchr.org/publication/KhotTW12},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {19},
  pages = {151},
}