Complexity Classifications of Boolean Constraint Satisfaction Problems - Couverture rigide

Creignou, Nadia; Khanna, Sanjeev; Sudan, Madhu

 
9780898714791: Complexity Classifications of Boolean Constraint Satisfaction Problems
Couverture rigide
ISBN 10 : 0898714796 ISBN 13 : 9780898714791
Editeur : Society for Industrial and Applied Mathematics, 1987

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Society for Industrial and Applied Mathematics
Date d'édition
1987
Langue
anglais
ISBN 10 
0898714796
ISBN 13 
9780898714791
Reliure
Relié
Nombre de pages
118
Coordonnées du fabricant
non disponible
Personne responsable
non disponible