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

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	November 2017
Authors:	Jin-yi. Cai • XI Chen
Dimensions:	236 x 158 x 30mm (L x W x T)
Format:	Hardcover
Pages:	470
ISBN-13:	978-1-107-06237-5
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Promotions
LSN:	1-107-06237-3
Barcode:	9781107062375

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!