3.6.4. Complexity

Denotes the fact that a keyword corresponds to a problem used to recognise NP -hard problems attached to the feasibility of a constraint.