BibTeX record conf/rp/Niskanen17

download as .bib file

@inproceedings{DBLP:conf/rp/Niskanen17,
  author       = {Reino Niskanen},
  editor       = {Matthew Hague and
                  Igor Potapov},
  title        = {Reachability Problem for Polynomial Iteration Is PSPACE-complete},
  booktitle    = {Reachability Problems - 11th International Workshop, {RP} 2017, London,
                  UK, September 7-9, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10506},
  pages        = {132--143},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-67089-8\_10},
  doi          = {10.1007/978-3-319-67089-8\_10},
  timestamp    = {Mon, 16 Sep 2019 15:23:44 +0200},
  biburl       = {https://dblp.org/rec/conf/rp/Niskanen17.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.