{ "items" : [
    { "id" : "http://dbpedia.org/resource/NP-completeness"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#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." ] ,
        "http://xmlns.com/foaf/0.1/depiction" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/P_np_np-complete_np-hard.svg" ] ,
        "http://dbpedia.org/ontology/thumbnail" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/P_np_np-complete_np-hard.svg?width=300"] } } }
