(CSP = "constraint satisfaction problem")
CSPs for which either the variables are restricted to less than two values or the constraints
take less than two inputs are obviously trivial, and Schaefer's dichotomy theorem
gives the complete situation for variables with two possible values.
How hard is it to solve CSPs with 2-variable constraints
but variables that can take more than two values?