Jin-Yi Cai

Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain (eBook, ePUB)

• Format: ePub

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 16. November 2017
• Englisch
• ISBN-13: 9781108505840
• Artikelnr.: 49421513

Autorenporträt

Jin-Yi Cai is Professor of Computer Science and the Steenbock Professor of Mathematical Sciences at the University of Wisconsin, Madison. He studied at Fudan University, Shanghai (class of 77) and at Cornell University, New York, receiving his Ph.D. in 1986. He held faculty positions at Yale University, Connecticut (1986-1989), Princeton University, New Jersey (1989-1993), and State University of New York, Buffalo (1993-2000), where he rose from Assistant Professor to Full Professor in 1996. He received a Presidential Young Investigator Award (1990), an Alfred P. Sloan Fellowship (1994), and a John Simon Guggenheim Fellowship (1998). He is a Fellow of the Association for Computing Machinery (ACM) and the American Association for the Advancement of Science (AAAS).

Inhaltsangabe

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.