ISBN-10:
0898714796
ISBN-13:
9780898714791
Pub. Date:
01/28/2001
Publisher:
SIAM
Complexity Classifications of Boolean Constraint Satisfaction Problems

Complexity Classifications of Boolean Constraint Satisfaction Problems

Hardcover

Current price is , Original price is $63.0. You
Select a Purchase Option

    Item is available through our marketplace sellers.

  • purchase options

Overview

Complexity Classifications of Boolean Constraint Satisfaction Problems

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.

Product Details

ISBN-13: 9780898714791
Publisher: SIAM
Publication date: 01/28/2001
Series: Monographs on Discrete Mathematics and Applications
Pages: 106
Product dimensions: 5.98(w) x 8.98(h) x 0.51(d)

Table of Contents

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

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews