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. The standard way to parameterize interesting subclass