Matches in DBpedia 2015-10 for { ?s ?p "Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses" }
Showing triples 1 to 1 of
1
with 100 triples per page.
DBpedia – Linked Data Fragments
