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 Exploring the Origin, Extent, and Future of Life by Jin-Yi Cai, Xi Chen
Cover of the book Dionysius of Halicarnassus and Augustan Rome by Jin-Yi Cai, Xi Chen
Cover of the book The Cambridge Handbook of Information and Computer Ethics by Jin-Yi Cai, Xi Chen
Cover of the book Byron's War by Jin-Yi Cai, Xi Chen
Cover of the book The Encyclopedia of European Migration and Minorities by Jin-Yi Cai, Xi Chen
Cover of the book The Cambridge Companion to Zola by Jin-Yi Cai, Xi Chen
Cover of the book Behavioral Neurology & Neuropsychiatry by Jin-Yi Cai, Xi Chen
Cover of the book Fundamentals of Electro-Optic Systems Design by Jin-Yi Cai, Xi Chen
Cover of the book Perioperative Drill-Based Crisis Management by Jin-Yi Cai, Xi Chen
Cover of the book George Bernard Shaw in Context by Jin-Yi Cai, Xi Chen
Cover of the book Duties to Care by Jin-Yi Cai, Xi Chen
Cover of the book Poetic Justice and Legal Fictions by Jin-Yi Cai, Xi Chen
Cover of the book SimWars Simulation Case Book: Emergency Medicine by Jin-Yi Cai, Xi Chen
Cover of the book The Holocaust and New World Slavery by Jin-Yi Cai, Xi Chen
Cover of the book The Material Culture of the Jacobites 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