### 3.7.249. Subset sum

Denotes that, by reduction to subset sum, deciding whether a constraint has a solution or not was shown to be NP-hard. The subset sum problem can be described as follows: given a finite set of integers in ${ℤ}^{+}$ and an integer $s$ in ${ℤ}^{+}$, does any subset sum equal exactly $s$?