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