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

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

PrefixNamespace IRI
n5http://commons.wikimedia.org/wiki/Special:FilePath/Complexity_classes.svg?width=
dbpedia-owlhttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7http://commons.wikimedia.org/wiki/Special:FilePath/Complexity_classes.
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpediahttp://dbpedia.org/resource/
Subject Item
dbpedia:P_versus_NP_problem
rdfs:comment
The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was essentially first mentioned in a 1956 letter written by Kurt Gödel to John von Neumann. Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
rdfs:seeAlso
dbpedia:Complexity_class
foaf:depiction
n7:svg
dbpedia-owl:thumbnail
n5:300