The Complexity of Partition Functions. Bulatov, A. A. & Grohe, M. In Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pages 294–306, 2004.
The Complexity of Partition Functions [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/icalp/BulatovG04,
  author    = {Andrei A. Bulatov and
               Martin Grohe},
  title     = {The Complexity of Partition Functions},
  booktitle = {Automata, Languages and Programming: 31st International Colloquium,
               {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
  pages     = {294--306},
  year      = {2004},
  crossref  = {DBLP:conf/icalp/2004},
  url       = {https://doi.org/10.1007/978-3-540-27836-8\_27},
  doi       = {10.1007/978-3-540-27836-8\_27},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/BulatovG04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0