BibTeX record conf/csr/Vereshchagin13

download as .bib file

@inproceedings{DBLP:conf/csr/Vereshchagin13,
  author       = {Nikolay K. Vereshchagin},
  editor       = {Andrei A. Bulatov and
                  Arseny M. Shur},
  title        = {Improving on Gutfreund, Shaltiel, and Ta-Shma's Paper "If {NP} Languages
                  Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances"},
  booktitle    = {Computer Science - Theory and Applications - 8th International Computer
                  Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
                  25-29, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7913},
  pages        = {203--211},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-38536-0\_18},
  doi          = {10.1007/978-3-642-38536-0\_18},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/Vereshchagin13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics