BibTeX record journals/eccc/ECCC-TR98-008

download as .bib file

@article{DBLP:journals/eccc/ECCC-TR98-008,
  author       = {Sanjeev Arora and
                  Carsten Lund and
                  Rajeev Motwani and
                  Madhu Sudan and
                  Mario Szegedy},
  title        = {Proof verification and the hardness of approximation problems},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR98-008}},
  year         = {1998},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-008/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR98-008},
  timestamp    = {Wed, 28 Sep 2022 15:27:24 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR98-008.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.