{
  "http://en.wikipedia.org/wiki/NP/poly" : { "http://xmlns.com/foaf/0.1/primaryTopic" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NP/poly" } ] } ,
  "http://dbpedia.org/resource/NP/poly" : { "http://www.w3.org/2002/07/owl#sameAs" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NP/poly" } ,
      { "type" : "uri", "value" : "http://www.wikidata.org/entity/Q60792186" } ,
      { "type" : "uri", "value" : "https://global.dbpedia.org/id/9GCwy" } ] ,
    "http://www.w3.org/2000/01/rdf-schema#label" : [ { "type" : "literal", "value" : "NP/poly" , "lang" : "en" } ] ,
    "http://purl.org/dc/terms/subject" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Complexity_classes" } ] ,
    "http://www.w3.org/ns/prov#wasDerivedFrom" : [ { "type" : "uri", "value" : "http://en.wikipedia.org/wiki/NP/poly?oldid=976493325&ns=0" } ] ,
    "http://xmlns.com/foaf/0.1/isPrimaryTopicOf" : [ { "type" : "uri", "value" : "http://en.wikipedia.org/wiki/NP/poly" } ] ,
    "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Complexity_classes" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Co-NP" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/NP_(complexity)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Complexity_class" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Karp\u2013Lipton_theorem" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Computational_hardness_assumption" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Mahaney's_theorem" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Non-deterministic_Turing_machine" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/P_versus_NP_problem" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Advice_(complexity)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Computational_complexity_theory" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Kernelization" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Polynomial_hierarchy" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Boolean_circuit" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Polynomial_time" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/P/poly" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Circuit_complexity" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/NP-complete" } ] ,
    "http://dbpedia.org/ontology/description" : [ { "type" : "literal", "value" : "clase de complejidad" , "lang" : "es" } ,
      { "type" : "literal", "value" : "classe di complessit\u00E0" , "lang" : "it" } ,
      { "type" : "literal", "value" : "complexity class" , "lang" : "en" } ,
      { "type" : "literal", "value" : "classe de complexit\u00E9" , "lang" : "fr" } ] ,
    "http://dbpedia.org/property/wikiPageUsesTemplate" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Reflist" } ] } ,
  "http://dbpedia.org/resource/Arthur\u2013Merlin_protocol" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NP/poly" } ] } ,
  "http://dbpedia.org/resource/Karp\u2013Lipton_theorem" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NP/poly" } ] } ,
  "http://dbpedia.org/resource/Kernelization" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NP/poly" } ] } ,
  "http://dbpedia.org/resource/P/poly" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NP/poly" } ] }
}