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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {5},
  number    = {8},
  year      = {1998},
  url       = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-008/index.html},
  timestamp = {Wed, 07 Dec 2011 17:05:30 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/eccc/ECCC-TR98-008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}