Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain, PDF eBook

Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain PDF

PDF

Download - Immediately Available
Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.

Information

Other Formats

Save 15%

£141.00

£119.85

Download - Immediately Available
Add to Basket
Sign in to add to wishlist
 
Delivered to your inbox

to transfer to your device

eBook Help

Is this the right eBook for
my device? How do I download
this eBook? See help and FAQs pages

Information