@article{DBLP:journals/siamcomp/GuruswamiHMRC11,
  author    = {Venkatesan Guruswami and
               Johan H{\aa}stad and
               Rajsekar Manokaran and
               Prasad Raghavendra and
               Moses Charikar},
  title     = {Beating the Random Ordering Is Hard: Every Ordering {CSP}
               Is Approximation Resistant},
  journal   = {SIAM J. Comput.},
  volume    = {40},
  number    = {3},
  year      = {2011},
  pages     = {878-914},
  ee        = {http://dx.doi.org/10.1137/090756144},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

{"_id":{"_str":"534243b90e946d920a00040e"},"__v":1,"authorIDs":[],"author_short":["Guruswami, V.","Håstad, J.","Manokaran, R.","Raghavendra, P.","Charikar, M."],"bibbaseid":"guruswami-hstad-manokaran-raghavendra-charikar-beatingtherandomorderingishardeveryorderingcspisapproximationresistant-2011","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Venkatesan"],"propositions":[],"lastnames":["Guruswami"],"suffixes":[]},{"firstnames":["Johan"],"propositions":[],"lastnames":["Håstad"],"suffixes":[]},{"firstnames":["Rajsekar"],"propositions":[],"lastnames":["Manokaran"],"suffixes":[]},{"firstnames":["Prasad"],"propositions":[],"lastnames":["Raghavendra"],"suffixes":[]},{"firstnames":["Moses"],"propositions":[],"lastnames":["Charikar"],"suffixes":[]}],"title":"Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant","journal":"SIAM J. Comput.","volume":"40","number":"3","year":"2011","pages":"878-914","ee":"http://dx.doi.org/10.1137/090756144","bibsource":"DBLP, http://dblp.uni-trier.de","bibtex":"@article{DBLP:journals/siamcomp/GuruswamiHMRC11,\n author = {Venkatesan Guruswami and\n Johan H{\\aa}stad and\n Rajsekar Manokaran and\n Prasad Raghavendra and\n Moses Charikar},\n title = {Beating the Random Ordering Is Hard: Every Ordering {CSP}\n Is Approximation Resistant},\n journal = {SIAM J. Comput.},\n volume = {40},\n number = {3},\n year = {2011},\n pages = {878-914},\n ee = {http://dx.doi.org/10.1137/090756144},\n bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\n","author_short":["Guruswami, V.","Håstad, J.","Manokaran, R.","Raghavendra, P.","Charikar, M."],"key":"DBLP:journals/siamcomp/GuruswamiHMRC11","id":"DBLP:journals/siamcomp/GuruswamiHMRC11","bibbaseid":"guruswami-hstad-manokaran-raghavendra-charikar-beatingtherandomorderingishardeveryorderingcspisapproximationresistant-2011","role":"author","urls":{"Link":"http://dx.doi.org/10.1137/090756144"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","downloads":0,"keywords":[],"search_terms":["beating","random","ordering","hard","ordering","csp","approximation","resistant","guruswami","håstad","manokaran","raghavendra","charikar"],"title":"Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant","year":2011,"dataSources":["Te9pFfTBkQvusPFGk","6sSgqzaHAPRWvSxTP"]}