Book contents
- Frontmatter
- Contents
- Preface
- 1 Counting Problems
- 2 Fibonacci Gates and Holant* Problems
- 3 Boolean #CSP
- 4 Matchgates and Holographic Algorithms
- 5 2-Spin Systems on Regular Graphs
- 6 Holant Problems and #CSP
- 7 Holant Dichotomy for Symmetric Constraints
- 8 Planar #CSP for Symmetric Constraints
- 9 Planar Holant for Symmetric Constraints
- 10 Dichotomies for Asymmetric Constraints
- Bibliography
- Index
9 - Planar Holant for Symmetric Constraints
Published online by Cambridge University Press: 06 November 2017
- Frontmatter
- Contents
- Preface
- 1 Counting Problems
- 2 Fibonacci Gates and Holant* Problems
- 3 Boolean #CSP
- 4 Matchgates and Holographic Algorithms
- 5 2-Spin Systems on Regular Graphs
- 6 Holant Problems and #CSP
- 7 Holant Dichotomy for Symmetric Constraints
- 8 Planar #CSP for Symmetric Constraints
- 9 Planar Holant for Symmetric Constraints
- 10 Dichotomies for Asymmetric Constraints
- Bibliography
- Index
Summary

- Type
- Chapter
- Information
- Complexity Dichotomies for Counting Problems , pp. 362 - 406Publisher: Cambridge University PressPrint publication year: 2017