Complexity Classifications of Boolean Constraint Satisfaction Problems

Name: Complexity Classifications of Boolean Constraint Satisfaction Problems
Brand: SIAM - SOCIETY FOR INDUSTRIAL AND APPLIED
Price: 194.75 AUD
Availability: BackOrder

By: Nadia Creignou, Sanjeev Khanna, Madhu Sudan

Write A Review

Hardcover | 29 June 2001

At a Glance

Hardcover
118 Pages

Dimensions(cm)
26.67 x 19.68 x 1.91

Hardcover

RRP $205.00

$194.75

or 4 interest-free payments of $48.69 with

or

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.