
CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 16228-16365
Annnotations
CORD-19_Custom_license_subset
Id | Subject | Object | Predicate | Lexical cue |
---|---|---|---|---|
T122 | 0-137 | Sentence | denotes | Actually the computation of D(S) is #P-hard, by showing a reduction from the positive partitioned 2-DNF assignment counting problem [9] . |
CORD-19-Sentences
Id | Subject | Object | Predicate | Lexical cue |
---|---|---|---|---|
TextSentencer_T122 | 0-137 | Sentence | denotes | Actually the computation of D(S) is #P-hard, by showing a reduction from the positive partitioned 2-DNF assignment counting problem [9] . |
TextSentencer_T122 | 0-137 | Sentence | denotes | Actually the computation of D(S) is #P-hard, by showing a reduction from the positive partitioned 2-DNF assignment counting problem [9] . |
T33146 | 0-137 | Sentence | denotes | Actually the computation of D(S) is #P-hard, by showing a reduction from the positive partitioned 2-DNF assignment counting problem [9] . |
Epistemic_Statements
Id | Subject | Object | Predicate | Lexical cue |
---|---|---|---|---|
T52 | 0-137 | Epistemic_statement | denotes | Actually the computation of D(S) is #P-hard, by showing a reduction from the positive partitioned 2-DNF assignment counting problem [9] . |