{
  "http://en.wikipedia.org/wiki/NEXPTIME" : { "http://xmlns.com/foaf/0.1/primaryTopic" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Exponential_time_hypothesis" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Dynamic_logic_(modal_logic)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Carsten_Lund" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Ryan_Williams_(computer_scientist)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Computational_complexity_theory" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Complexity_class" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/P/poly" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/EXPSPACE" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Time_hierarchy_theorem" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/List_of_complexity_classes" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/2-EXPTIME" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Interactive_proof_system" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Circuits_over_sets_of_natural_numbers" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/NEXPTIME" : { "http://www.w3.org/2002/07/owl#sameAs" : [ { "type" : "uri", "value" : "http://ca.dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://yago-knowledge.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "https://global.dbpedia.org/id/aPrP" } ,
      { "type" : "uri", "value" : "http://zh.dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://pt.dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://de.dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://www.wikidata.org/entity/Q1575791" } ,
      { "type" : "uri", "value" : "http://rdf.freebase.com/ns/m.030wh5" } ,
      { "type" : "uri", "value" : "http://es.dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://fr.dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://ja.dbpedia.org/resource/NEXPTIME" } ,
      { "type" : "uri", "value" : "http://sr.dbpedia.org/resource/NEXPTIME" } ] ,
    "http://www.w3.org/2000/01/rdf-schema#label" : [ { "type" : "literal", "value" : "NEXPTIME" , "lang" : "zh" } ,
      { "type" : "literal", "value" : "NEXPTIME" , "lang" : "fr" } ,
      { "type" : "literal", "value" : "NEXPTIME" , "lang" : "en" } ,
      { "type" : "literal", "value" : "NEXPTIME" , "lang" : "de" } ,
      { "type" : "literal", "value" : "NEXPTIME" , "lang" : "es" } ,
      { "type" : "literal", "value" : "NEXPTIME" , "lang" : "ja" } ,
      { "type" : "literal", "value" : "NEXPTIME" , "lang" : "ca" } ,
      { "type" : "literal", "value" : "NEXPTIME" , "lang" : "pt" } ] ,
    "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/NEXPTIME?oldid=1307736808&ns=0" } ] ,
    "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Cambridge_University_Press" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Computational_complexity_theory" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Game_complexity" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Time_hierarchy_theorem" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/P_(complexity)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/E_(complexity)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Polynomial_time" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Interactive_proof_system" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Algorithm" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Complexity_class" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Adjacency_matrix" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Polynomial-time_many-one_reduction" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Hamiltonian_path" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Succinct_circuit" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Probabilistically_checkable_proof" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/NTIME" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/NE_(complexity)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Sparse_language" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Category:Complexity_classes" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/NP_(complexity)" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/NP-complete" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Formal_language" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Non-deterministic_Turing_machine" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Decision_problem" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Padding_argument" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/P_=_NP_problem" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/EXPTIME" } ] ,
    "http://dbpedia.org/ontology/wikiPageExternalLink" : [ { "type" : "uri", "value" : "http://www.cs.princeton.edu/theory/complexity/" } ] ,
    "http://dbpedia.org/ontology/description" : [ { "type" : "literal", "value" : "classe di complessit\u00E0" , "lang" : "it" } ,
      { "type" : "literal", "value" : "complexity class" , "lang" : "en" } ,
      { "type" : "literal", "value" : "clase de complejidad" , "lang" : "es" } ,
      { "type" : "literal", "value" : "classe de complexit\u00E9" , "lang" : "fr" } ] ,
    "http://dbpedia.org/property/wikiPageUsesTemplate" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Citation" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:ComplexityClasses" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Math" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:CZoo" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Short_description" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Tmath" } ,
      { "type" : "uri", "value" : "http://dbpedia.org/resource/Template:Sans-serif" } ] ,
    "http://xmlns.com/foaf/0.1/isPrimaryTopicOf" : [ { "type" : "uri", "value" : "http://en.wikipedia.org/wiki/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/EXPTIME" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Harry_R._Lewis" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Exponential_hierarchy" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Bernays\u2013Sch\u00F6nfinkel_class" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/NEXP" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] ,
    "http://dbpedia.org/ontology/wikiPageRedirects" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/Integer_circuit" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/NE_(complexity)" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] } ,
  "http://dbpedia.org/resource/ACC0" : { "http://dbpedia.org/ontology/wikiPageWikiLink" : [ { "type" : "uri", "value" : "http://dbpedia.org/resource/NEXPTIME" } ] }
}