CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 8513-8631 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/CORD-19/sourceid/6e2db98aa242e3e84116afdfad5e250943c55ac5","sourcedb":"CORD-19","sourceid":"6e2db98aa242e3e84116afdfad5e250943c55ac5","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.","tracks":[{"project":"Epistemic_Statements","denotations":[{"id":"T25","span":{"begin":0,"end":118},"obj":"Epistemic_statement"}],"attributes":[{"subj":"T25","pred":"source","obj":"Epistemic_Statements"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"Epistemic_Statements","color":"#939dec","default":true}]}]}}