Constraint satisfaction on finite groups, with subgroups and their cosets described by generators, has a polynomial time algorithm. For any given group, a single additional constraint type that is not a coset of a near subgroup makes the problem NP-complete. We consider constraint satisfaction on groups with subgroups, near subgroups, ... more >>>