
Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
- English
- PDF
- Available on iOS & Android
Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
About this book
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics.
Tools to learn more effectively

Saving Books

Keyword Search

Annotating Text

Listen to it instead
Information
Table of contents
- Cover
- Half title
- Title
- Copyright
- 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
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app