BibTeX record conf/stoc/CaiNS99

download as .bib file

@inproceedings{DBLP:conf/stoc/CaiNS99,
  author       = {Jin{-}yi Cai and
                  Ajay Nerurkar and
                  D. Sivakumar},
  editor       = {Jeffrey Scott Vitter and
                  Lawrence L. Larmore and
                  Frank Thomson Leighton},
  title        = {Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial
                  Time},
  booktitle    = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages        = {726--735},
  publisher    = {{ACM}},
  year         = {1999},
  url          = {https://doi.org/10.1145/301250.301444},
  doi          = {10.1145/301250.301444},
  timestamp    = {Tue, 06 Nov 2018 11:07:05 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/CaiNS99.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.