CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 8513-8631 JSONTXT

{"project":"Epistemic_Statements","denotations":[{"id":"T25","span":{"begin":0,"end":118},"obj":"Epistemic_statement"}],"text":"• We show the NP-hardness of DTM problem as it can be shown to contain the Set Cover problem as a simple special case."}