Loading... Please wait...

Complexity Classifications of Boolean Constraint Satisfaction Problems

Hover over image to zoom

RRP: $78.00
$10.00 (You save $68.00)
Order Code:

 Product Description

by Nadia Creignou, Sanjeev Khanna, and Madhu Sudan


2001 / xii + 106 pages / Hardcover / ISBN: 978-0-898714-79-1 / List Price $78.00 / SIAM Member Price $54.60 / Order Code DT07

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.

This volume will be of interest to both researchers and practitioners working in combinatorial optimization and complexity theory. It is suitable for use as a supplementary text in courses on approximation and computational complexity.

Preface; Chapter 1: Introduction; Chapter 2: Complexity Classes; Chapter 3: Boolean Constraint Satisfaction Problems; Chapter 4: Characterizations of Constraint Functions; Chapter 5: Implementation of Functions and Reductions; Chapter 6: Classification Theorems for Decision, Counting and Quantified Problems; Chapter 7: Classification Theorems for Optimization Problems; Chapter 8: Input-Restricted Constrained Satisfaction Problems; Chapter 9: The Complexity of the Meta-Problems; Chapter 10: Concluding Remarks; Bibliography; Index


ISBN: 9780898714791

 Find Similar Products by Category

Vendors Other Products

 Product Reviews

This product hasn't received any reviews yet. Be the first to review this product!

You Recently Viewed...



Follow us on

Copyright 2017 SIAM Bookstore. All Rights Reserved.
Sitemap | BigCommerce Premium Themes by PSDCenter

Society for Industrial and Applied Mathematics 3600 Market St., 6th Fl. Philadelphia, PA 19104-2688 USA +1-215-382-9800 FAX: +1-215-386-7999 www.siam.org email: siambooks@siam.org

Click the button below to add the Complexity Classifications of Boolean Constraint Satisfaction Problems to your wish list.