BabelNet

bn:03445750n

Noun Concept

Categories: Mathematical optimization, Unsolved problems in mathematics, Computer-related introductions in 1956, Structural complexity theory, Unsolved problems in computer science

P versus NP problem Algebrization complexity classes P and NP NP=P NP=P problem

The P versus NP problem is a major unsolved problem in theoretical computer science. Wikipedia

Definitions

Relations

Sources

The P versus NP problem is a major unsolved problem in theoretical computer science. Wikipedia

IS A

problem

open problem

mathematical problem

PART OF

Millennium Prize Problems

FACET OF

NAMED AFTER

Wikipedia

P versus NP problem

Wikidata

P versus NP problem

Wikipedia Redirections

Algebrization, complexity classes P and NP, NP=P, NP=P problem, NP = P, NP conjecture, NP problem, NP versus P conjecture, NP versus P problem, Np vs p, P!=NP, P/=NP, P/NP Problem, P==NP, P=?NP, P=NP, P=NP?, P=NP problem, P = NP, P = NP?, P = NP problem, P ? NP, P and NP, P conjecture, P is not NP, P v NP, P versus NP, P versus NP conjecture, P Versus NP Problem, P vs. NP, P vs. NP problem, P vs NP, P vs NP problem, P ≟ NP, P ≠ NP, P≟NP, P≟NP problem, P≠NP, Smale's third problem, Succinct problem, Succinct problems, Vinay Deolalikar, Vinay Deolilakar

Wikidata Alias

P=NP, P is not NP, P versus NP