{"product_id":"9780898714791","title":"Complexity Classifications of Boolean Constraint Satisfaction Problems","description":"\u003cp\u003eMany 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 volume 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 provides an excellent framework for discovering and formally validating \"global\" inferences about the nature of computation.\u003c\/p\u003e","brand":"SIAM - SOCIETY FOR INDUSTRIAL AND APPLIED","offers":[{"title":"Default Title","offer_id":47436468879412,"sku":"9780898714791","price":205.0,"currency_code":"AUD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0651\/9390\/2132\/files\/9780898714791.jpg?v=1774739850","url":"https:\/\/woodslane.com.au\/products\/9780898714791","provider":"Woodslane","version":"1.0","type":"link"}