Call Boomerang Books 1300 36 33 32

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.

Buy Complexity Classifications of Boolean Constraint Satisfaction Problems book by Nadia Creignou from Australia's Online Independent Bookstore, Boomerang Books.

Book Details

ISBN: 9780898714791
ISBN-10: 0898714796
Format: Hardback
(228mm x 152mm x 13mm)
Pages: 118
Imprint: Society for Industrial & Applied Mathematics,U.S.
Publisher: Society for Industrial & Applied Mathematics,U.S.
Publish Date: 1-Jan-1987
Country of Publication: United States

Reviews

» Have you read this book? We'd like to know what you think about it - write a review about Complexity Classifications of Boolean Constraint Satisfaction Problems book by Nadia Creignou and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a Boomerang Books Account Holder - it's free to sign up and there are great benefits!)

Write Review