CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 8513-8631
Annnotations
Epistemic_Statements
| Id | Subject | Object | Predicate | Lexical cue |
|---|---|---|---|---|
| T25 | 0-118 | Epistemic_statement | denotes | • We show the NP-hardness of DTM problem as it can be shown to contain the Set Cover problem as a simple special case. |