Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

Complexity Classifications of Boolean Constraint Satisfaction Problems
Hardback

Complexity Classifications of Boolean Constraint Satisfaction Problems

$230.99
Sign in or become a Readings Member to add this title to your wishlist.

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 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.

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO
Format
Hardback
Publisher
Society for Industrial & Applied Mathematics,U.S.
Country
United States
Date
1 January 1987
Pages
118
ISBN
9780898714791

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 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.

Read More
Format
Hardback
Publisher
Society for Industrial & Applied Mathematics,U.S.
Country
United States
Date
1 January 1987
Pages
118
ISBN
9780898714791