This HTML5 document contains 3 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
dbpedia-owlhttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n4http://commons.wikimedia.org/wiki/Special:FilePath/P_np_np-complete_np-hard.
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://commons.wikimedia.org/wiki/Special:FilePath/P_np_np-complete_np-hard.svg?width=
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpediahttp://dbpedia.org/resource/
Subject Item
dbpedia:NP-completeness
rdfs:comment
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often denoted by NP-C or NPC.
foaf:depiction
n4:svg
dbpedia-owl:thumbnail
n6:300