Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
-
Form:Einzelkauf Download
-
Sprache:Englisch
-
eBook Format:ePUB
- PDF Fr. 157.90
- ePUB Fr. 130.90 ausgewählt
Fr. 130.90
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
ePUB
Kopierschutz
Ja
Family Sharing
Ja
Text-to-Speech
Ja
Erscheinungsdatum
16.11.2017
Verlag
Cambridge University PressSeitenzahl
(Printausgabe)
Dateigröße
97089 KB
Sprache
Englisch
EAN
9781108505840
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.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung