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
~38 min read
Article
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?
Connections
time complexity
Entity
polynomial hierarchy
Entity
parameterized complexity
Entity
polynomial
Entity
Turing machine
Entity
theory of computation
Entity
travelling salesperson problem
Entity
integer factorization
Entity
Clay Mathematics Institute
Entity
NP-hard
Entity
non-deterministic Turing machine
Entity
oracle machine
Entity
♯P
Entity
♯P-complete
Entity
philosophy
Entity
chess
Entity
YouTube
Concept
economics
Entity
Artificial intelligence
Concept
computer science
Entity