BibTeX record conf/stacs/GanesanH89

download as .bib file

@inproceedings{DBLP:conf/stacs/GanesanH89,
  author       = {K. Ganesan and
                  Steven Homer},
  editor       = {Burkhard Monien and
                  Robert Cori},
  title        = {Complete Problems and Strong Polynomial Reducibilities},
  booktitle    = {{STACS} 89, 6th Annual Symposium on Theoretical Aspects of Computer
                  Science, Paderborn, FRG, February 16-18, 1989, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {349},
  pages        = {240--250},
  publisher    = {Springer},
  year         = {1989},
  url          = {https://doi.org/10.1007/BFb0028988},
  doi          = {10.1007/BFB0028988},
  timestamp    = {Wed, 17 Nov 2021 14:45:32 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GanesanH89.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.