Editing Constraint satisfaction (section)

===Complexity===
{{main|Complexity of constraint satisfaction}}

Solving a constraint satisfaction problem on a finite domain is an [[NP-complete]] problem with respect to the domain size. Research has shown a number of [[Tractable problem|tractable]] subcases, some limiting the allowed constraint relations, some requiring the scopes of constraints to form a tree, possibly in a reformulated version of the problem. Research has also established relationships of the constraint satisfaction problem with problems in other areas such as [[finite model theory]].