Matches in DBpedia 2014 for { ?s ?p In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. A general computational problem may have numerical parameters.. }
Showing items 1 to 1 of
1
with 100 items per page.