BibTeX record conf/stoc/BeameCEIP95

download as .bib file

@inproceedings{DBLP:conf/stoc/BeameCEIP95,
  author    = {Paul Beame and
               Stephen A. Cook and
               Jeff Edmonds and
               Russell Impagliazzo and
               Toniann Pitassi},
  title     = {The relative complexity of {NP} search problems},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
               of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  pages     = {303--314},
  year      = {1995},
  crossref  = {DBLP:conf/stoc/STOC27},
  url       = {https://doi.org/10.1145/225058.225147},
  doi       = {10.1145/225058.225147},
  timestamp = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/BeameCEIP95},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC27,
  editor    = {Frank Thomson Leighton and
               Allan Borodin},
  title     = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
               of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  publisher = {{ACM}},
  year      = {1995},
  isbn      = {0-89791-718-9},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/STOC27},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier