@Article{burgisser_et_al:DagRep.3.1.47,
author = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark and Koiran, Pascal},
title = {{Computational Counting (Dagstuhl Seminar 13031)}},
pages = {47--66},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {3},
number = {1},
editor = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark and Koiran, Pascal},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.1.47},
URN = {urn:nbn:de:0030-drops-40087},
doi = {10.4230/DagRep.3.1.47},
annote = {Keywords: Computational complexity, counting problems, graph polynomials, holographic algorithms, statistical physics, constraint satisfaction}
}