BibTeX record journals/cpc/Verbitsky95

download as .bib file

@article{DBLP:journals/cpc/Verbitsky95,
  author       = {Oleg Verbitsky},
  title        = {On the Hardness of Approximating Some Optimization Problems That Are
                  Supposedly Easier Than {MAX} {CLIQUE}},
  journal      = {Comb. Probab. Comput.},
  volume       = {4},
  pages        = {167--180},
  year         = {1995},
  url          = {https://doi.org/10.1017/S0963548300001553},
  doi          = {10.1017/S0963548300001553},
  timestamp    = {Thu, 13 Oct 2022 22:23:57 +0200},
  biburl       = {https://dblp.org/rec/journals/cpc/Verbitsky95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics