Generalizations
The analysis was later fine-tuned: CSP(Γ) is either solvable in co-NLOGTIME, L-complete, NL-complete, ⊕L-complete, P-complete or NP-complete and given Γ, one can decide in polynomial time which of these cases holds.
Schaefer's dichotomy theorem was recently generalized to a larger class of relations.
Read more about this topic: Schaefer's Dichotomy Theorem