Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain | Agenda Bookshop Skip to content
Online orders placed from 19/12 onward will not arrive in time for Christmas.
Online orders placed from 19/12 onward will not arrive in time for Christmas.
A01=Jin-Yi Cai
A01=Xi Chen
Age Group_Uncategorized
Age Group_Uncategorized
Author_Jin-Yi Cai
Author_Xi Chen
automatic-update
Category1=Non-Fiction
Category=UMB
COP=United Kingdom
Delivery_Delivery within 10-20 working days
Language_English
PA=In stock
Price_€100 and above
PS=Active
softlaunch

Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain

★★★★★
★★★★★

English

By (author): Jin-Yi Cai Xi Chen

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. See more
€147.24
€154.99
Save 5%
A01=Jin-Yi CaiA01=Xi ChenAge Group_UncategorizedAuthor_Jin-Yi CaiAuthor_Xi Chenautomatic-updateCategory1=Non-FictionCategory=UMBCOP=United KingdomDelivery_Delivery within 10-20 working daysLanguage_EnglishPA=In stockPrice_€100 and abovePS=Activesoftlaunch
Delivery/Collection within 10-20 working days
Product Details
  • Weight: 770g
  • Dimensions: 158 x 236mm
  • Publication Date: 16 Nov 2017
  • Publisher: Cambridge University Press
  • Publication City/Country: United Kingdom
  • Language: English
  • ISBN13: 9781107062375

About Jin-Yi CaiXi Chen

Jin-Yi Cai is Professor of Computer Science and the Steenbock Professor of Mathematical Sciences at the University of Wisconsin Madison. He studied at Fudan University Shanghai (class of 77) and at Cornell University New York receiving his Ph.D. in 1986. He held faculty positions at Yale University Connecticut (19861989) Princeton University New Jersey (19891993) and State University of New York Buffalo (19932000) where he rose from Assistant Professor to Full Professor in 1996. He received a Presidential Young Investigator Award (1990) an Alfred P. Sloan Fellowship (1994) and a John Simon Guggenheim Fellowship (1998). He is a Fellow of the Association for Computing Machinery (ACM) and the American Association for the Advancement of Science (AAAS). Xi Chen is Associate Professor of Computer Science at Columbia University New York. He studied at Tsinghua University and received his Ph.D. in 2007. His research focuses on complexity theory and algorithmic game theory. He is the recipient of a NSF CAREER Award an Alfred P. Sloan Fellowship (2012) and an European Association for Theoretical Computer Science (EATCS) Presburger Award (2015).

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept