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-Z of Abdominal Radiology by Jin-Yi Cai, Xi Chen
Cover of the book Knowing and Not Knowing in Intimate Relationships by Jin-Yi Cai, Xi Chen
Cover of the book The Mechanics of Earthquakes and Faulting by Jin-Yi Cai, Xi Chen
Cover of the book Atlas of Emergency Ultrasound by Jin-Yi Cai, Xi Chen
Cover of the book King Richard II by Jin-Yi Cai, Xi Chen
Cover of the book The New Moon by Jin-Yi Cai, Xi Chen
Cover of the book Luther and Calvin on Secular Authority by Jin-Yi Cai, Xi Chen
Cover of the book Greek Epigram and Byzantine Culture by Jin-Yi Cai, Xi Chen
Cover of the book Plato's Cosmology and its Ethical Dimensions by Jin-Yi Cai, Xi Chen
Cover of the book A Concise History of Finland by Jin-Yi Cai, Xi Chen
Cover of the book Sanctions, Statecraft, and Nuclear Proliferation by Jin-Yi Cai, Xi Chen
Cover of the book Quantum Chromodynamics by Jin-Yi Cai, Xi Chen
Cover of the book George Eliot's Intellectual Life by Jin-Yi Cai, Xi Chen
Cover of the book The Uses of the Past from Heidegger to Rorty by Jin-Yi Cai, Xi Chen
Cover of the book The Age of Charisma 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