On the Complexity of Hard Enumeration Problems (bibtex)
by Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
Reference:
On the Complexity of Hard Enumeration ProblemsNadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert VollmerLanguage and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings (Frank Drewes, Carlos Martín-Vide, Bianca Truthe, eds.), volume 10168 of Lecture Notes in Computer Science, pages 183–195, 2017.
Bibtex Entry:
@inproceedings{DBLP:conf/lata/CreignouKPSV17,
  author    = {Nadia Creignou and
               Markus Kr{\"{o}}ll and
               Reinhard Pichler and
               Sebastian Skritek and
               Heribert Vollmer},
  editor    = {Frank Drewes and
               Carlos Mart{\'{\i}}n{-}Vide and
               Bianca Truthe},
  title     = {On the Complexity of Hard Enumeration Problems},
  booktitle = {Language and Automata Theory and Applications - 11th International
               Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10168},
  pages     = {183--195},
  year      = {2017},
  url       = {https://arxiv.org/abs/1610.05493},
  doi       = {10.1007/978-3-319-53733-7_13},
  timestamp = {Wed, 24 May 2017 08:29:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/lata/CreignouKPSV17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
Powered by bibtexbrowser