Complexity Dichotomies for Counting Problems
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.
- 2017 Jin-Yi Cai and Xi Chen
- Book Quality:
- Cambridge University Press
- Date of Addition:
- Computers and Internet, Mathematics and Statistics, Nonfiction,
- Usage Restrictions:
- This is a copyrighted book.
Choosing a Book Format
EPUB is the standard publishing format used by many e-book readers including iBooks, Easy Reader, VoiceDream Reader, etc. This is the most popular and widely used format.
DAISY format is used by GoRead, Read2Go and most Kurzweil devices.
Audio (MP3) format is used by audio only devices, such as iPod.
Braille format is used by Braille output devices.
DAISY Audio format works on DAISY compatible players such as Victor Reader Stream.
Accessible Word format can be unzipped and opened in any tool that supports .docx files.