10%OFF
Stock image for illustration purposes only - book cover, edition or condition may vary.
Complexity Classifications of Boolean Constraint Satisfaction Problems
Creignou, Nadia; Khanna, Sanjeev; Sudan, Madhu
€ 102.54
€ 92.57
FREE Delivery in Ireland
Description for Complexity Classifications of Boolean Constraint Satisfaction Problems
Hardcover.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
1987
Publisher
Society for Industrial & Applied Mathematics,U.S. United States
Number of pages
118
Condition
New
Number of Pages
118
Place of Publication
New York, United States
ISBN
9780898714791
SKU
V9780898714791
Shipping Time
Usually ships in 5 to 9 working days
Ref
99-3
Reviews for Complexity Classifications of Boolean Constraint Satisfaction Problems