• We show the NP-hardness of DTM problem as it can be shown to contain the Set Cover problem as a simple special case.