Boolean domain
著者
書誌事項
Boolean domain
（Complexity dichotomies for counting problems, v. 1）
Cambridge University Press, c2017
大学図書館所蔵 件 / 全3件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 451-458) and index
内容説明・目次
内容説明
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.
目次
- 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.
「Nielsen BookData」 より