DBpedia – Linked Data Fragments
DBpedia 2015-10
Query DBpedia 2015-10 by triple pattern
subject
predicate
object
Matches in DBpedia 2015-10 for
{ ?s ?p "Proof that Boolean satisfiability problem is NP-complete"@en }
Showing triples 1 to 1 of
1
with
100
triples per page.
Proof_that_Boolean_satisfiability_problem_is_NP-complete
label
"
Proof that Boolean satisfiability problem is NP-complete
"
.
