{"product_id":"complexity-classifications-of-boolean-constraint-satisfaction-problems-hardback-9780898714791","title":"Complexity Classifications of Boolean Constraint Satisfaction Problems (Hardback) 9780898714791","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eComplexity Classifications of Boolean Constraint Satisfaction Problems\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003ePresents a novel form of a compendium that classifies an infinite number of problems by using a rule-based approach.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eNadia Creignou (Author), Sanjeev Khanna (Author), Madhu Sudan (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780898714791\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 31 March 2001\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e118 pages\u003cbr\u003e22.8 x 15.1 x 1.2 cm, 0.452 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\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 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface\u003cbr\u003e 1. Introduction\u003cbr\u003e 2. Complexity Classes\u003cbr\u003e 3. Boolean Constraint Satisfaction Problems\u003cbr\u003e 4. Characterizations of Constraint Functions\u003cbr\u003e 5. Implementation of Functions and Reductions\u003cbr\u003e 6. Classification Theorems for Decision, Counting and Quantified Problems\u003cbr\u003e 7. Classification Theorems for Optimization Problems\u003cbr\u003e 8. Input-Restricted Constrained Satisfaction Problems\u003cbr\u003e 9. The Complexity of the Meta-Problems\u003cbr\u003e 10. Concluding Remarks\u003cbr\u003e Bibliography\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Miscellaneous items [\u003ca title=\"See our other books on Miscellaneous items\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Miscellaneous%20items%20%5BWZ%5D%22\"\u003eWZ\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"MP–SIA SIAM – Society for Industrial and Applied M","offers":[{"title":"Brand New","offer_id":52410746863896,"sku":"9780898714791","price":57.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9780898714791I.jpg?v=1784251368","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/complexity-classifications-of-boolean-constraint-satisfaction-problems-hardback-9780898714791","provider":"Freshly Printed Books","version":"1.0","type":"link"}