Complexity Classifications of Boolean Constraint Satisfaction Problems (Monographs on Discrete Mathematics and Applications, Series Number 7)

Creignou, Nadia,Khanna, Sanjeev,Sudan, Madhu

ISBN 10: 0898714796 / ISBN 13: 9780898714791

Published by Society for Industrial and Appli, 1987

About this Item

Ex-library copy with usual markings. Prelim pages are slightly warped.

Seller Inventory # mon0003172952

Bibliographic Details

• Title: Complexity Classifications of Boolean Constraint Satisfaction Problems (Monographs on Discrete Mathematics and Applications, Series Number 7)
• Publisher: Society for Industrial and Appli
• Publication Date: 1987
• Language: English
• ISBN 10: 0898714796
• ISBN 13: 9780898714791
• Binding: hardcover
• Condition: Good

About this title

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.

Product Description

Complexity Classifications of Boolean Constraint Satisfaction Problems Presents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach. Full description