SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Computing / Volume 34 / Issue 3

SIAM J. Comput. 34, pp. 720-742 (23 pages)

Classifying the Complexity of Constraints Using Finite Algebras

Andrei Bulatov, Peter Jeavons, and Andrei Krokhin

Full Text: Download PDF | Buy PDF (US$25) | View Cart
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and we explore how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra. Hence, we completely translate the problem of classifying the complexity of restricted constraint satisfaction problems into the language of universal algebra.
We introduce a notion of "tractable algebra," and investigate how the tractability of an algebra relates to the tractability of the smaller algebras which may be derived from it, including its subalgebras and homomorphic images. This allows us to reduce significantly the types of algebras which need to be classified. Using our results we also show that if the decision problem associated with a given collection of constraint types can be solved efficiently, then so can the corresponding search problem. We then classify all finite strictly simple surjective algebras with respect to tractability, obtaining a dichotomy theorem which generalizes Schaefer's dichotomy for the generalized satisfiability problem. Finally, we suggest a possible general algebraic criterion for distinguishing the tractable and intractable cases of the constraint satisfaction problem.

© 2005 Society for Industrial and Applied Mathematics

RELATED DATABASES

To view database links for this article, you need to log in.

KEYWORDS

AMS Subject Headings

08A70, 68Q25, 68T99

PUBLICATION DATA

ISSN:

0097-5397 (print)  
1095-7111 (online)

Publisher:

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

Permalink
http://dx.doi.org/10.1137/S0097539700376676

For access to fully linked references, you need to log in.

For access to citing articles, you need to log in.


Close

Your Recent History Recent History Help

Recently Viewed

  1. Classifying the Complexity of Constraints Using Finite Algebras
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close