About: dbpedia:P_versus_NP

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: dbpedia:P_versus_NP_problem Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : platform.yourdatastories.eu:8890 associated with source document(s)

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.

Attributes	Values
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
thumbnail	http://commons.wikimedia.org/wiki/Special:FilePath/Complexity_classes.svg?width=300
is known for of	Aaronson, Scott

Faceted Search & Find service v1.13.91 as of Nov 14 2017

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3212 as of Mar 29 2016, on Linux (x86_64-unknown-linux-gnu), Single-Server Edition (68 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software