3.7.210. Set packing

Denotes the fact that, by reduction to set packing, deciding whether a constraint has a solution or not was shown to be NP -hard. The set packing problem can be described as follows: given a collection C of n finite sets, and a positive integer mn, does C contains m disjoint sets?