Search dblp for Publications

export results for "Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant."

 download as .bib file

@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},
  pages        = {878--914},
  year         = {2011},
  url          = {https://doi.org/10.1137/090756144},
  doi          = {10.1137/090756144},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GuruswamiHMRC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/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      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR11-027}},
  year         = {2011},
  url          = {https://eccc.weizmann.ac.il/report/2011/027},
  eprinttype    = {ECCC},
  eprint       = {TR11-027},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/GuruswamiHMRC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics