On the Exact Learnability of Graph Parameters: The Case of Partition Functions (bibtex)
by Nadia Labai, Johann A. Makowsky
Reference:
On the Exact Learnability of Graph Parameters: The Case of Partition FunctionsNadia Labai, Johann A. Makowsky41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of LIPIcs, pages 63:1–63:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Bibtex Entry:
@inproceedings{DBLP:conf/mfcs/LabaiM16,
  author    = {Nadia Labai and
               Johann A. Makowsky},
  editor    = {Piotr Faliszewski and
               Anca Muscholl and
               Rolf Niedermeier},
  title     = {On the Exact Learnability of Graph Parameters: The Case of Partition
               Functions},
  booktitle = {41st International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
  series    = {LIPIcs},
  volume    = {58},
  pages     = {63:1--63:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {https://arxiv.org/abs/1606.04056},
  timestamp = {Thu, 25 May 2017 00:43:01 +0200},
  biburl    = {http://dblp2.uni-trier.de/rec/bib/conf/mfcs/LabaiM16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
Powered by bibtexbrowser