CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 16228-16365
Annnotations
CORD-19_Custom_license_subset
{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T122","span":{"begin":0,"end":137},"obj":"Sentence"}],"text":"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
{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T122","span":{"begin":0,"end":137},"obj":"Sentence"},{"id":"TextSentencer_T122","span":{"begin":0,"end":137},"obj":"Sentence"},{"id":"T33146","span":{"begin":0,"end":137},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"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
{"project":"Epistemic_Statements","denotations":[{"id":"T52","span":{"begin":0,"end":137},"obj":"Epistemic_statement"}],"text":"Actually the computation of D(S) is #P-hard, by showing a reduction from the positive partitioned 2-DNF assignment counting problem [9] ."}