Complexity Classifications of Boolean Constraint Satisfaction Problems by Madhu Sudan
---------------------------------------------------------------
Author: Madhu Sudan
Number of Pages: 118 pages
Published Date: 01 Mar 2001
Publisher: Society for Industrial & Applied Mathematics,U.S.
Publication Country: New York, United States
Language: English
ISBN: 9780898714791
Download Link: complexity classifications of boolean constraint satisfaction problems
---------------------------------------------------------------
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.
Read online Complexity Classifications of Boolean Constraint Satisfaction Problems
Buy Complexity Classifications of Boolean Constraint Satisfaction Problems
Download and read Complexity Classifications of Boolean Constraint Satisfaction Problems ebook, pdf, djvu, epub, mobi, fb2, zip, rar, torrent
Download to iPad/iPhone/iOS, B&N nook Complexity Classifications of Boolean Constraint Satisfaction Problems