• Media type: Text; E-Article
  • Title: On the Complexity of Holant Problems
  • Contributor: Guo, Heng [Author]; Lu, Pinyan [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
  • Language: English
  • DOI: https://doi.org/10.4230/DFU.Vol7.15301.159
  • Keywords: Counting complexity ; Holant problems ; Dichotomy theorems ; Approximate counting ; Computational complexity
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: In this article we survey recent developments on the complexity of Holant problems. We discuss three different aspects of Holant problems: the decision version, exact counting, and approximate counting.
  • Access State: Open Access