Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain

Nonfiction, Science & Nature, Mathematics, Number Theory, Computers, General Computing
Cover of the book Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain by Jin-Yi Cai, Xi Chen, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Jin-Yi Cai, Xi Chen ISBN: 9781108505840
Publisher: Cambridge University Press Publication: November 16, 2017
Imprint: Cambridge University Press Language: English
Author: Jin-Yi Cai, Xi Chen
ISBN: 9781108505840
Publisher: Cambridge University Press
Publication: November 16, 2017
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book A Certain Uncertainty by Jin-Yi Cai, Xi Chen
Cover of the book Analytical Modeling of Heterogeneous Cellular Networks by Jin-Yi Cai, Xi Chen
Cover of the book Ancient Libraries by Jin-Yi Cai, Xi Chen
Cover of the book Why Trust a Theory? by Jin-Yi Cai, Xi Chen
Cover of the book Making a New Deal by Jin-Yi Cai, Xi Chen
Cover of the book Why Is There Philosophy of Mathematics At All? by Jin-Yi Cai, Xi Chen
Cover of the book Hypertension in Pregnancy by Jin-Yi Cai, Xi Chen
Cover of the book Trees by Jin-Yi Cai, Xi Chen
Cover of the book Self-Awareness in Islamic Philosophy by Jin-Yi Cai, Xi Chen
Cover of the book China as a Polar Great Power by Jin-Yi Cai, Xi Chen
Cover of the book Art and Vision in the Inca Empire by Jin-Yi Cai, Xi Chen
Cover of the book Bayesian Astrophysics by Jin-Yi Cai, Xi Chen
Cover of the book German by Jin-Yi Cai, Xi Chen
Cover of the book Early Childhood Curriculum by Jin-Yi Cai, Xi Chen
Cover of the book Pemmican Empire by Jin-Yi Cai, Xi Chen
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy