P versus NP problem
unsolved problem in computer science about time complexity
Facts
7 properties- Instance of
- mathematical problem, open problem[2]
- Part of
- Millennium Problems[5]
- Facet of
- P, NP, computation complexity theory[8][9][10]
- Defining formula
- P = NP \ \text{or} \ P \neq NP?, \mathrm{P} \overset{?}{=} \mathrm{NP}
- In defining formula
- P, NP
🏷️ Also known as
en P=NP
en P = NP
en P versus NP
en P ≟ NP
en P vs. NP
en P ?= NP
en P≟NP
en P versus NP problem
en P is not NP
en P != NP
ar مسألة P = NP
ar مسألة P=NP
ar مسالة P=NP
ar مسألة P-NP
ar مسأله P=NP
cs Problém P versus NP
cs P versus NP
cs P=NP
cs P vs. NP
de P=NP
🔖 Identifiers · 13
- OpenAlex ID
- C186861659
- BBC Things ID
- d28d0fb6-8d51-4225-924d-1ee7f10a7c2f
- BabelNet ID
- 03445750n
- Brilliant Wiki ID
- p-versus-np
- Encyclopædia Britannica Online ID
- topic/P-versus-NP-problem, topic/P-problem
- Freebase ID
- /m/01txp
- MathWorld ID
- PVersusNPProblem
- Microsoft Academic ID (discontinued)
- 186861659
- Namuwiki ID
- P-NP 문제
- NicoNicoPedia word article ID
- p≠np予想
- Quora topic ID
- P-vs-NP
- Stack Exchange tag
- stackoverflow.com, cstheory.stackexchange.com, cs.stackexchange.com
Show all 13 identifiers +1
- YSO ID
- 28319
🔗 Connections
Facet of 2
Instance of 2
Belongs to 1
Main subject 1
Maintained by WikiProject 1
Named after 1
On focus list of Wikimedia project 1
Part of 1
← Facet of 1
Press Enter · cited answer in seconds
0 sources
Summary
P versus NP problem is a mathematical problem[1].