Complexity Classifications of Boolean Constraint Satisfaction Problems

Nadia Creignou, Sanjeev Khanna, Madhu Sudan (Autoren)

Buch | Hardcover

118 Seiten

2001
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-479-1 (ISBN)

Titel z.Zt. nicht lieferbar
Versandkostenfrei
Auch auf Rechnung

Artikel merken

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.

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

Erscheint lt. Verlag	31.3.2001
Reihe/Serie	SIAM Monographs on Discrete Mathematics and Applications
Verlagsort	New York
Sprache	englisch
Maße	151 x 228 mm
Gewicht	452 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
	Mathematik / Informatik ► Mathematik ► Graphentheorie
	Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
ISBN-10	0-89871-479-6 / 0898714796
ISBN-13	978-0-89871-479-1 / 9780898714791
Zustand	Neuware