|
|
books
| book details |
Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
By (author) Jin-Yi Cai, By (author) Xi Chen
|
| on special |
normal price: R 6 725.95
Price: R 6 388.95
|
| book 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.
| product details |
Normally shipped |
Publisher | Cambridge University Press
Published date | 16 Nov 2017
Language |
Format | Hardback
Pages | 470
Dimensions | 236 x 158 x 30mm (L x W x H)
Weight | 770g
ISBN | 978-1-1070-6237-5
Readership Age |
BISAC | computers / programming / algorithms
| other options |
Normally shipped |
Readership Age |
Normal Price | R 7 569.95
Price | R 7 191.95
| on special |
|
|
To view the items in your trolley please sign in.
| sign in |
|
|
|
| specials |
|
Emil Coetzee, a civil servant in his fifties, is washing blood off his hands when the ceasefire is announced.
|
An epic love story with the pulse of a thriller that asks: what would you risk for a second chance at first love?
|
This is indeed a story of mercy and the redemption it offers.
|
|
|
|
