
2001 / xii + 106 pages / Hardcover / ISBN: 9780898714791 / 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 rulebased 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.
Audience
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.
Contents
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: InputRestricted Constrained Satisfaction Problems; Chapter 9: The Complexity of the MetaProblems; Chapter 10: Concluding Remarks; Bibliography; Index
ISBN: 9780898714791