The Complexity of Somewhat Approximation Resistant Predicates. Khot, S., Tulsiani, M., & Worah, P. Electronic Colloquium on Computational Complexity (ECCC), 19:151, 2012.
The Complexity of Somewhat Approximation Resistant Predicates [link]Link  bibtex   
@article{KTW-SoAR,
  author    = {Subhash Khot and
               Madhur Tulsiani and
               Pratik Worah},
  title     = {The Complexity of Somewhat Approximation Resistant Predicates},
  journal   = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume    = {19},
  year      = {2012},
  pages     = {151},
  ee        = {http://eccc.hpi-web.de/report/2012/151},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Downloads: 0