@InCollection{guo_et_al:DFU.Vol7.15301.159,
author = {Guo, Heng and Lu, Pinyan},
title = {{On the Complexity of Holant Problems}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {159--177},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Krokhin, Andrei and Zivny, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DFU.Vol7.15301.159},
URN = {urn:nbn:de:0030-drops-69630},
doi = {10.4230/DFU.Vol7.15301.159},
annote = {Keywords: Computational complexity, Counting complexity, Dichotomy theorems, Approximate counting, Holant problems}
}