The complexity of weighted counting for acyclic conjunctive queries. Durand, A. & Mengel, S. J. Comput. Syst. Sci., 80(1):277–296, 2014.
The complexity of weighted counting for acyclic conjunctive queries [link]Paper  doi  bibtex   
@article{DBLP:journals/jcss/DurandM14,
  author    = {Arnaud Durand and
               Stefan Mengel},
  title     = {The complexity of weighted counting for acyclic conjunctive queries},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {80},
  number    = {1},
  pages     = {277--296},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.jcss.2013.08.001},
  doi       = {10.1016/j.jcss.2013.08.001},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/DurandM14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0