P versus NP problem
Sign in to saveAlso known as P versus NP, P=NP, P is not NP, P = NP, P != NP, P ?= NP, P≟NP, P ≟ NP
unsolved problem in computer science about time complexity
Wikidata facts
- Instance of
- open problem
- Part of
- Millennium Problems
- Named after
- NP
- Main subject
- NP
Show 4 more facts
- Stack Exchange tag
- cs.stackexchange.com/tags/p-vs-np
- facet of
- computational complexity theory
- on focus list of Wikimedia project
- Wikipedia:Vital articles/Level/4
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0
~38 min read
Encyclopedic overview
Unsolved problem in computer science
If the solution to a problem can be checked in polynomial time, must the problem be solvable in polynomial time?
Excerpted from Wikipedia’s “P versus NP problem” article, available under the CC BY-SA 4.0 licence.