Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and ...
Read More
Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating "global" inferences about the nature of computation. This book presents a novel and compact form of a compendium that classifies an infinite number of problems by using a rule-based approach. This enables practitioners to determine whether or not a given problem is known to be computationally intractable. It also provides a complete classification of all problems that arise in restricted versions of central complexity classes such as NP, NPO, NC, PSPACE, and #P.
Read Less
Add this copy of Complexity Classifications of Boolean Constraint to cart. $21.04, good condition, Sold by Anybook rated 5.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 2001 by Society For Industrial And Applied Mathematics.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
Publisher:
Society for Industrial and Applied Mathematics (SIAM)
Published:
2001
Language:
English
Alibris ID:
17836999045
Shipping Options:
Standard Shipping: $4.57
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This is an ex-library book and may have the usual library/used-book markings inside. This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 550grams, ISBN: 9780898714791.
Add this copy of Complexity Classifications of Boolean Constraint to cart. $27.00, very good condition, Sold by The Book Bin rated 5.0 out of 5 stars, ships from Salem, OR, UNITED STATES, published 1987 by Society for Industrial and Applied Mathematics.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
Add this copy of Complexity Classifications of Boolean Constraint to cart. $19.14, good condition, Sold by Books From California rated 4.0 out of 5 stars, ships from Simi Valley, CA, UNITED STATES, published 1987 by Society for Industrial and Appli.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
Add this copy of Complexity Classifications of Boolean Constraint to cart. $62.99, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1987 by Society for Industrial and App.
Edition:
1987, Society for Industrial and Applied Mathematics (SIAM)
